Sciweavers

356 search results - page 31 / 72
» Robust and efficient algorithms for rank join evaluation
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
15 years 7 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
MIR
2006
ACM
200views Multimedia» more  MIR 2006»
15 years 3 months ago
An adaptive graph model for automatic image annotation
Automatic keyword annotation is a promising solution to enable more effective image search by using keywords. In this paper, we propose a novel automatic image annotation method b...
Jing Liu, Mingjing Li, Wei-Ying Ma, Qingshan Liu, ...
JMLR
2008
159views more  JMLR 2008»
14 years 9 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
PDPTA
2004
14 years 11 months ago
Towards an Adaptive Economic Society of Peers
This paper presents our on-going research into selforganizing and self-healing networks of resource brokers, for use in complex Peer-to-Peer (P2P) resource sharing and Grid comput...
Paul Silvey