Sciweavers

932 search results - page 78 / 187
» Where in the Wikipedia Is That Answer
Sort
View
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
14 years 3 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala
DEXA
2009
Springer
177views Database» more  DEXA 2009»
14 years 3 months ago
Querying XML Data with SPARQL
SPARQL is today the standard access language for Semantic Web data. In the recent years XML databases have also acquired industrial importance due to the widespread applicability o...
Nikos Bikakis, Nektarios Gioldasis, Chrisa Tsinara...
DIS
2009
Springer
14 years 3 months ago
Subspace Discovery for Promotion: A Cell Clustering Approach
The promotion analysis problem has been proposed in [16], where ranking-based promotion query processing techniques are studied to effectively and efficiently promote a given obje...
Tianyi Wu, Jiawei Han
LICS
2007
IEEE
14 years 3 months ago
Separating DAG-Like and Tree-Like Proof Systems
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
Phuong Nguyen
COCOON
2007
Springer
14 years 3 months ago
On the Hardness of Optimization in Power Law Graphs
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
Alessandro Ferrante, Gopal Pandurangan, Kihong Par...