Sciweavers

528 search results - page 69 / 106
» Computing Large and Small Stable Models
Sort
View
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
13 years 12 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
PVLDB
2008
108views more  PVLDB 2008»
13 years 7 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
SIGCOMM
2009
ACM
14 years 2 months ago
Beyond friendship graphs: a study of user interactions in Flickr
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...
Masoud Valafar, Reza Rejaie, Walter Willinger
CVPR
2001
IEEE
14 years 9 months ago
Convex and Non-convex Illuminant Constraints for Dichromatic Colour Constancy
The dichromatic reflectance model introduced by Shafer [16] predicts that the colour signals of most materials fall on a plane spanned by a vector due to the material and a vector...
Graham D. Finlayson, Gerald Schaefer
NAACL
2010
13 years 5 months ago
Minimally-Supervised Extraction of Entities from Text Advertisements
Extraction of entities from ad creatives is an important problem that can benefit many computational advertising tasks. Supervised and semi-supervised solutions rely on labeled da...
Sameer Singh, Dustin Hillard, Chris Leggetter