Sciweavers

4850 search results - page 57 / 970
» Approximate Data Structures with Applications
Sort
View
WWW
2003
ACM
15 years 10 months ago
Piazza: data management infrastructure for semantic web applications
The Semantic Web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. To this point, researchers have defined new l...
Alon Y. Halevy, Zachary G. Ives, Peter Mork, Igor ...
INFORMATICALT
2008
92views more  INFORMATICALT 2008»
14 years 9 months ago
On Structural Analysis of Parliamentarian Voting Data
We investigate applicability of quantitative methods to discover the most fundamental structural properties of the most reliable political data in Lithuania. Namely, we analyze vot...
Tomas Krilavicius, Antanas Zilinskas
CIKM
2005
Springer
15 years 3 months ago
Versatile structural disambiguation for semantic-aware applications
In this paper, we propose a versatile disambiguation approach which can be used to make explicit the meaning of structure based information such as XML schemas, XML document struc...
Federica Mandreoli, Riccardo Martoglia, Enrico Ron...
WADS
2009
Springer
268views Algorithms» more  WADS 2009»
15 years 4 months ago
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...
RSFDGRC
2005
Springer
133views Data Mining» more  RSFDGRC 2005»
15 years 3 months ago
Rough Set Approximation Based on Dynamic Granulation
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is defined. Some properties o...
Jiye Liang, Yuhua Qian, Chengyuan Chu, Deyu Li, Ju...