Sciweavers

774 search results - page 97 / 155
» Markov incremental constructions
Sort
View
WWW
2003
ACM
14 years 9 months ago
Scaling personalized web search
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's P...
Glen Jeh, Jennifer Widom
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
14 years 9 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
EDBT
2004
ACM
119views Database» more  EDBT 2004»
14 years 9 months ago
NNH: Improving Performance of Nearest-Neighbor Searches Using Histograms
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
Liang Jin, Nick Koudas, Chen Li
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
14 years 3 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
CSMR
2007
IEEE
14 years 3 months ago
Example-Driven Reconstruction of Software Models
As software systems evolve, they become more complex and harder to understand and maintain. Certain reverse engineering techniques attempt to reconstruct software models from sour...
Oscar Nierstrasz, Markus Kobel, Tudor Gîrba,...