Sciweavers

10271 search results - page 1775 / 2055
» Computer Science
Sort
View
COMPGEOM
2005
ACM
15 years 8 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
CSCW
2010
ACM
16 years 3 months ago
Communication, collaboration, and bugs: the social nature of issue tracking in small, collocated teams
Issue tracking systems help organizations manage issue reporting, assignment, tracking, resolution, and archiving. Traditionally, it is the Software Engineering community that res...
Dane Bertram, Amy Voida, Saul Greenberg, Robert Wa...
CSCW
2004
ACM
16 years 1 days ago
Avoiding interference: how people use spatial separation and partitioning in SDG workspaces
Single Display Groupware (SDG) lets multiple co-located people, each with their own input device, interact simultaneously over a single communal display. While SDG is beneficial, ...
Edward Tse, Jonathan Histon, Stacey D. Scott, Saul...
STACS
2010
Springer
16 years 1 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
FOCS
2008
IEEE
16 years 1 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
« Prev « First page 1775 / 2055 Last » Next »