Sciweavers

2004 search results - page 333 / 401
» Sampling from large graphs
Sort
View
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 4 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
WEBDB
2009
Springer
100views Database» more  WEBDB 2009»
14 years 4 months ago
Towards Well-Behaved Schema Evolution
We study the problem of schema evolution in the RDF data model. RDF and the RDFS schema language are W3C standards for flexibly modeling and sharing data on the web. Although sch...
Rada Chirkova, George H. L. Fletcher
SLIP
2009
ACM
14 years 4 months ago
Honeycomb-structured computational interconnects and their scalable extension to spherical domains
The present paper is part of a larger effort to redesign, from the ground up, the best possible interconnect topologies for switchless multiprocessor computer systems. We focus he...
Joseph B. Cessna, Thomas R. Bewley
ICPP
2008
IEEE
14 years 4 months ago
Resource Allocation for Distributed Streaming Applications
—We consider resource allocation for distributed streaming applications running in a grid environment, where continuously streaming data needs to be aggregated and processed to p...
Qian Zhu, Gagan Agrawal
SMI
2008
IEEE
107views Image Analysis» more  SMI 2008»
14 years 4 months ago
Approximate topological matching of quadrilateral meshes
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...