Sciweavers

11211 search results - page 1780 / 2243
» Rank-Sensitive Data Structures
Sort
View
144
Voted
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 9 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
FOCS
2000
IEEE
15 years 9 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICDE
2000
IEEE
89views Database» more  ICDE 2000»
15 years 9 months ago
Managing Escalation of Collaboration Processes in Crisis Mitigation Situations
Processes for crisis mitigation must permit coordination flexibility and dynamic change to empower crisis mitigation coordinators and experts to deal with the unexpected situatio...
Dimitrios Georgakopoulos, Hans Schuster, Donald Ba...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 9 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
ANZIIS
1996
IEEE
15 years 9 months ago
An object oriented intelligent tourist advisor system
This paper describes the design and developmentof an expert system for tourist information center. The expert system was built to recommend a suitable travel schedule that satisfi...
C. H. K. Tsang, M. H. C. Woo, C. Bloor
« Prev « First page 1780 / 2243 Last » Next »