1969 search results - page 229 / 394 » Financial Theory 1 |
218
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
164
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
278
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
179
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
160
click to vote
SPAA
2009
ACM
16 years 22 days ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...