Sciweavers

813 search results - page 46 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
ICDE
2010
IEEE
236views Database» more  ICDE 2010»
14 years 6 months ago
Explaining Structured Queries in Natural Language
— Many applications offer a form-based environment for na¨ıve users for accessing databases without being familiar with the database schema or a structured query language. User...
Alkis Simitsis, Georgia Koutrika, Yannis E. Ioanni...
SPAA
2009
ACM
14 years 3 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
ACL
2007
13 years 10 months ago
PageRanking WordNet Synsets: An Application to Opinion Mining
This paper presents an application of PageRank, a random-walk model originally devised for ranking Web search results, to ranking WordNet synsets in terms of how strongly they pos...
Andrea Esuli, Fabrizio Sebastiani
TIT
2010
174views Education» more  TIT 2010»
13 years 3 months ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...
AIRWEB
2008
Springer
13 years 11 months ago
Web spam identification through content and hyperlinks
We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as we...
Jacob Abernethy, Olivier Chapelle, Carlos Castillo