Sciweavers

536 search results - page 32 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
SSD
2005
Springer
116views Database» more  SSD 2005»
14 years 1 months ago
PA-Tree: A Parametric Indexing Scheme for Spatio-temporal Trajectories
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...
Jinfeng Ni, Chinya V. Ravishankar
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 5 months ago
Towards a communication-theoretic understanding of system-level power consumption
Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be signif...
Pulkit Grover, Kristen Ann Woyach, Anant Sahai
CSL
2007
Springer
14 years 2 months ago
Tightening the Exchange Rates Between Automata
Automata on infinite objects were the key to the solution of several fundamental decision problems in mathematics and logic. Today, automata on infinite objects are used for form...
Orna Kupferman
INFOCOM
2012
IEEE
12 years 6 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...