7751 search results - page 1321 / 1551 » Data streams: algorithms and applications |
173
click to vote
CP
2007
Springer
16 years 23 days ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
159
click to vote
SPIRE
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
172
click to vote
WADS
2007
Springer
16 years 21 days ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
142
click to vote
HICSS
2006
IEEE
16 years 20 days ago
2006
IEEE
Large enterprises in application domains such as finance, banking, travel services, and hospital management use business processes for their day-to-day business. An integral part ...
177
click to vote
INFOCOM
2006
IEEE
16 years 19 days ago
2006
IEEE
— In reliable multicast, data packets can be cached at some nodes such as repair servers for future possible retransmission in loss recovery schemes. How to cache packets to opti...