Sciweavers

4542 search results - page 561 / 909
» Design patterns for data structures
Sort
View
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 6 months ago
Succinct Geometric Indexes Supporting Point Location Queries
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Mahesh...
IUI
2010
ACM
16 years 1 months ago
Intelligent understanding of handwritten geometry theorem proving
Computer-based geometry systems have been widely used for teaching and learning, but largely based on mouse-andkeyboard interaction, these systems usually require users to draw fi...
Yingying Jiang, Feng Tian, Hongan Wang, Xiaolong Z...
CCS
2011
ACM
14 years 6 months ago
MIDeA: a multi-parallel intrusion detection architecture
Network intrusion detection systems are faced with the challenge of identifying diverse attacks, in extremely high speed networks. For this reason, they must operate at multi-Giga...
Giorgos Vasiliadis, Michalis Polychronakis, Sotiri...
ICDE
1995
IEEE
101views Database» more  ICDE 1995»
16 years 8 months ago
Two-Level Caching of Composite Object Views of Relational Databases
We describe a two-level client-side cache for composite objects mapped as views of a relational database. A semantic model, the Structural Model, is used to specify joins on the r...
Catherine Hamon, Arthur M. Keller
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
16 years 7 months ago
Mining templates from search result records of search engines
Metasearch engine, Comparison-shopping and Deep Web crawling applications need to extract search result records enwrapped in result pages returned from search engines in response ...
Hongkun Zhao, Weiyi Meng, Clement T. Yu