Sciweavers

2373 search results - page 332 / 475
» On the Theory of Structural Subtyping
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 10 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
CCS
2008
ACM
15 years 8 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
ER
2008
Springer
123views Database» more  ER 2008»
15 years 8 months ago
Modeling and Querying E-Commerce Data in Hybrid Relational-XML DBMSs
Abstract. Data in many industrial application systems are often neither completely structured nor unstructured. Consequently semi-structured data models such as XML have become pop...
Lipyeow Lim, Haixun Wang, Min Wang
ETVC
2008
15 years 8 months ago
Abstracts of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing
s of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing Frank Nielsen Ecole Polytechnique, Palaiseau, France Sony CSL, Tokyo, Japan Abstract. We list the abstracts o...
Frank Nielsen
CLA
2007
15 years 8 months ago
Representing Numeric Values in Concept Lattices
Formal Concept Analysis is based on the occurrence of symbolic attributes in individual objects, or observations. But, when the attribute is numeric, treatment has been awkward. In...
John L. Pfaltz