Sciweavers

4536 search results - page 44 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ESA
2006
Springer
92views Algorithms» more  ESA 2006»
13 years 11 months ago
Out-of-Order Event Processing in Kinetic Data Structures
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...
IIE
2007
56views more  IIE 2007»
13 years 7 months ago
Recursion Versus Iteration with the List as a Data Structure
Abstract. A reversible sequence of steps from the specification of the algorithm and the mathematical definition of the recurrent solution through the recursive procedure, the ta...
Izabella Foltynowicz
AAAI
2007
13 years 10 months ago
Data Structures for Generalised Arc Consistency for Extensional Constraints
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagatio...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 9 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
13 years 6 months ago
Large-Scale Support Vector Learning with Structural Kernels
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
Aliaksei Severyn, Alessandro Moschitti