Sciweavers

3625 search results - page 708 / 725
» On Timed Models of Gene Networks
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SIGMOD
2005
ACM
178views Database» more  SIGMOD 2005»
14 years 8 months ago
Towards Effective Indexing for Very Large Video Sequence Database
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
Heng Tao Shen, Beng Chin Ooi, Xiaofang Zhou
EUROSYS
2008
ACM
14 years 5 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...
COCOON
2007
Springer
14 years 2 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
FCCM
2006
IEEE
133views VLSI» more  FCCM 2006»
14 years 1 months ago
A Scalable FPGA-based Multiprocessor
It has been shown that a small number of FPGAs can significantly accelerate certain computing tasks by up to two or three orders of magnitude. However, particularly intensive lar...
Arun Patel, Christopher A. Madill, Manuel Salda&nt...