Sciweavers

900 search results - page 45 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
PVLDB
2011
12 years 11 months ago
Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
Stratos Idreos, Stefan Manegold, Harumi A. Kuno, G...
AAAI
2010
13 years 10 months ago
Coalitional Structure Generation in Skill Games
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet...
APBC
2007
110views Bioinformatics» more  APBC 2007»
13 years 10 months ago
Fast Structural Similarity Search Based on Topology String Matching
ibe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search bas...
Sung-Hee Park, David Gilbert, Keun Ho Ryu
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
13 years 6 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002
GBRPR
2007
Springer
14 years 3 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke