Sciweavers

10901 search results - page 2033 / 2181
» Approximations in Distributed Optimization
Sort
View
228
Voted
POPL
2003
ACM
16 years 4 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
138
Voted
RECOMB
2004
Springer
16 years 4 months ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
136
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 4 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
223
Voted
VLDB
2004
ACM
112views Database» more  VLDB 2004»
16 years 3 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
153
Voted
MOBIHOC
2006
ACM
16 years 3 months ago
Balancing distance and lifetime in delay constrained ad hoc networks
This paper addresses the problem of optimizing the packet transmission schedule in an ad hoc network with end-toend delay constraints. The emphasis is to determine the proper rela...
Ben Liang, Min Dong
« Prev « First page 2033 / 2181 Last » Next »