Results 1  10
of
276
Incremental integer linear programming for nonprojective dependency parsing
 In EMNLP
, 2006
"... Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such as nonprojective dependency parsing and machine translation, the complete formulation of the decoding problem as an integ ..."
Abstract

Cited by 63 (6 self)
 Add to MetaCart
as an integer linear program renders solving intractable. We present an approach which solves the problem incrementally, thus we avoid creating intractable integer linear programs. This approach is applied to Dutch dependency parsing and we show how the addition of linguistically motivated constraints can yield
Multilingual dependency parsing with incremental integer linear programming
, 2006
"... Our approach to dependency parsing is based on the linear model of McDonald et al.(McDonald et al., 2005b). Instead of solving the linear model using the Maximum Spanning Tree algorithm we propose an incremental Integer Linear Programming formulation of the problem that allows us to enforce linguist ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Our approach to dependency parsing is based on the linear model of McDonald et al.(McDonald et al., 2005b). Instead of solving the linear model using the Maximum Spanning Tree algorithm we propose an incremental Integer Linear Programming formulation of the problem that allows us to enforce
Treadmarks: Shared memory computing on networks of workstations
 Computer
, 1996
"... TreadMarks supports parallel computing on networks of workstations by providing the application with a shared memory abstraction. Shared memory facilitates the transition from sequential to parallel programs. After identifying possible sources of parallelism in the code, most of the data structures ..."
Abstract

Cited by 487 (37 self)
 Add to MetaCart
can be retained without change, and only synchronization needs to be added to achieve a correct shared memory parallel program. Additional transformations may be necessary to optimize performance, but this can be done in an incremental fashion. We discuss the techniques used in TreadMarks to provide e
Incremental Form
"... candidates last pixel Note that line could have passed through any part of this pixel Decision variable: d = ∆x(ab) d is an integer d < 0 use upper pixel d> 0 use lower pixel ..."
Abstract
 Add to MetaCart
candidates last pixel Note that line could have passed through any part of this pixel Decision variable: d = ∆x(ab) d is an integer d < 0 use upper pixel d> 0 use lower pixel
Incremental Consistent Updates
"... A consistent update installs a new packetforwarding policy across the switches of a softwaredefined network in place of an old policy. While doing so, such an update guarantees that every packet entering the network either obeys the old policy or the new one, but not some combination of the two. I ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
integer linear program. Moreover, to ensure the largest flows are moved first, while using rule space efficiently, we extend the mixed integer linear program with additional constraints. Our initial experiments show that a 6round, optimized incremental update decreases rule space overhead from 100
Incremental and Transitive Discrete Rotations
, 2005
"... A discrete rotation algorithm can be apprehended as a parametric application fα from Z[i] to Z[i], whose resulting permutation “looks like ” the map induced by an Euclidean rotation. For this kind of algorithm, to be incremental means to compute successively all the intermediate rotated copies of an ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
of an image for angles inbetween 0 and a destination angle. The discretized rotation consists in the composition of an Euclidean rotation with a discretization; the aim of this article is to describe an algorithm which computes incrementally a discretized rotation. The suggested method uses only integer
Efficient FetchandIncrement ⋆
"... Abstract. A Fetch&Inc object stores a nonnegative integer and supports a single operation, fi, that returns the value of the object and increments it. Such objects are used in many asynchronous shared memory algorithms, such as renaming, mutual exclusion, and barrier synchronization. We present ..."
Abstract
 Add to MetaCart
Abstract. A Fetch&Inc object stores a nonnegative integer and supports a single operation, fi, that returns the value of the object and increments it. Such objects are used in many asynchronous shared memory algorithms, such as renaming, mutual exclusion, and barrier synchronization. We
Fast Increment Registers
"... We give an optimal, waitfree implementation of an increment register. An increment register is a concurrent object consisting of an integervalued register with an increment operation that atomically increments the register and returns the previous value. We implement this register in a synchronous ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We give an optimal, waitfree implementation of an increment register. An increment register is a concurrent object consisting of an integervalued register with an increment operation that atomically increments the register and returns the previous value. We implement this register in a
Threshold Counters with Increments and Decrements?
"... A threshold counter is a shared data structure that assumes integer values. It provides two operations: Increment changes the current counter value from v to v + 1, while Read returns the value bv=wc, where v is the current counter value and w is a xed constant. Thus, the Read operation returns the ..."
Abstract
 Add to MetaCart
A threshold counter is a shared data structure that assumes integer values. It provides two operations: Increment changes the current counter value from v to v + 1, while Read returns the value bv=wc, where v is the current counter value and w is a xed constant. Thus, the Read operation returns
Threshold Counters with Increments and Decrements
, 1999
"... A threshold counter is a shared data structure that assumes integer v ues. It provides two operations: Increment changes the current counter val from v to v #1, while Read returns the value #v#w#,wherev is the curre counter value and w is a fixed constant. Thus, the Read operation retur the "ap ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A threshold counter is a shared data structure that assumes integer v ues. It provides two operations: Increment changes the current counter val from v to v #1, while Read returns the value #v#w#,wherev is the curre counter value and w is a fixed constant. Thus, the Read operation retur the "
Results 1  10
of
276