Sciweavers

683 search results - page 127 / 137
» A Fine-grained Analysis of a Simple Independent Set Algorith...
Sort
View
178
Voted
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 7 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
INFOCOM
2012
IEEE
13 years 6 months ago
Scaling social media applications into geo-distributed clouds
—Federation of geo-distributed cloud services is a trend in cloud computing which, by spanning multiple data centers at different geographical locations, can provide a cloud plat...
Yu Wu, Chuan Wu, Bo Li 0001, Linquan Zhang, Zongpe...
EUROPAR
1997
Springer
15 years 7 months ago
Modulo Scheduling with Cache Reuse Information
Instruction scheduling in general, and software pipelining in particular face the di cult task of scheduling operations in the presence of uncertain latencies. The largest contrib...
Chen Ding, Steve Carr, Philip H. Sweany
125
Voted
JIB
2007
153views more  JIB 2007»
15 years 3 months ago
Duplicate detection of 2D-NMR Spectra
2D-Nuclear magnetic resonance (NMR) spectra are used in the (structural) analysis of small molecules. In contrast to 1D-NMR spectra, 2D-NMR spectra correlate the chemical shifts o...
Alexander Hinneburg, Björn Egert, Andrea Porz...
144
Voted
EMNLP
2007
15 years 5 months ago
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
David A. Smith, Jason Eisner