Sciweavers

7930 search results - page 548 / 1586
» Greedy in Approximation Algorithms
Sort
View
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 12 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
TASE
2010
IEEE
15 years 1 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
16 years 8 months ago
Dynamic Load Distribution in the Borealis Stream Processor
Distributed and parallel computing environments are becoming cheap and commonplace. The availability of large numbers of CPU's makes it possible to process more data at highe...
Ying Xing, Stanley B. Zdonik, Jeong-Hyon Hwang
ICNP
2009
IEEE
16 years 1 months ago
Scalable Video Multicast in Multi-carrier Wireless Data Systems
—Future 4G cellular networks are featured with high data rate and improved coverage, which will enable realtime video multicast and broadcast services. Scalable video coding is v...
Peilong Li, Honghai Zhang, Baohua Zhao, Sampath Ra...
WABI
2007
Springer
110views Bioinformatics» more  WABI 2007»
16 years 1 months ago
Haplotype Inference Via Hierarchical Genotype Parsing
The within-species genetic variation due to recombinations leads to a mosaic-like structure of DNA. This structure can be modeled, e.g. by parsing sample sequences of current DNA w...
Pasi Rastas, Esko Ukkonen