Sciweavers

10414 search results - page 440 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
PVLDB
2008
138views more  PVLDB 2008»
15 years 6 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik
MP
2010
119views more  MP 2010»
15 years 5 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...
EDBT
2009
ACM
165views Database» more  EDBT 2009»
15 years 4 months ago
Exploiting the power of relational databases for efficient stream processing
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
Erietta Liarou, Romulo Goncalves, Stratos Idreos
169
Voted
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
16 years 7 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
16 years 7 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor