Sciweavers

664 search results - page 31 / 133
» Generalized Search Trees for Database Systems
Sort
View
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 11 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
CORR
2007
Springer
151views Education» more  CORR 2007»
15 years 4 months ago
Decision tree modeling with relational views
Data mining is a useful decision support technique that can be used to discover production rules in warehouses or corporate data. Data mining research has made much effort to appl...
Fadila Bentayeb, Jérôme Darmont
IPCV
2008
15 years 5 months ago
Content Based Retrieval System for Archaeological Images
Most of the existing image retrieval systems take the textual query from the user and utilize the metadata associated with the database images to retrieve the result. However, the...
Akshay Asthana, Ranjan Dutta, Anshul Jain, Deepak ...
ICALP
2005
Springer
15 years 10 months ago
The Generalized Deadlock Resolution Problem
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwa...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 4 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...