Sciweavers

11211 search results - page 12 / 2243
» Rank-Sensitive Data Structures
Sort
View
ENTCS
2000
154views more  ENTCS 2000»
13 years 9 months ago
Debugging Haskell by Observing Intermediate Data Structures
Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell commun...
Andy Gill
PUC
2002
90views more  PUC 2002»
13 years 9 months ago
Data Structures in the Design of Interfaces
Computer science algorithms can be used to improve user interfaces. Using data structures as a source of design ideas, a new interface was constructed for a cellular telephone han...
Gary Marsden, Harold W. Thimbleby, Matt Jones, Pau...
JACM
2010
135views more  JACM 2010»
13 years 8 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
ISPDC
2010
IEEE
13 years 8 months ago
Operational Semantics of the Marte Repetitive Structure Modeling Concepts for Data-Parallel Applications Design
—This paper presents an operational semantics of the repetitive model of computation, which is the basis for the repetitive structure modeling (RSM) package defined in the stand...
Abdoulaye Gamatié, Vlad Rusu, Éric R...
ICDCS
2011
IEEE
12 years 9 months ago
Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing
— In the emerging cloud computing paradigm, data owners become increasingly motivated to outsource their complex data management systems from local sites to the commercial public...
Ning Cao, Zhenyu Yang, Cong Wang, Kui Ren, Wenjing...