Sciweavers

9842 search results - page 1507 / 1969
» Compositional timing analysis
Sort
View
MOBIHOC
2003
ACM
16 years 5 months ago
Localization from mere connectivity
It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. W...
Yi Shang, Wheeler Ruml, Ying Zhang, Markus P. J. F...
WSDM
2010
ACM
210views Data Mining» more  WSDM 2010»
16 years 3 months ago
Leveraging Temporal Dynamics of Document Content in Relevance Ranking
Many web documents are dynamic, with content changing in varying amounts at varying frequencies. However, current document search algorithms have a static view of the document con...
Jonathan L. Elsas, Susan T. Dumais
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 3 months ago
BQP and the Polynomial Hierarchy
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
Scott Aaronson
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
16 years 3 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
16 years 3 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
« Prev « First page 1507 / 1969 Last » Next »