Sciweavers

932 search results - page 140 / 187
» Where in the Wikipedia Is That Answer
Sort
View
TKDE
2008
178views more  TKDE 2008»
13 years 7 months ago
Efficient Similarity Search over Future Stream Time Series
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...
Xiang Lian, Lei Chen 0002
JCP
2007
122views more  JCP 2007»
13 years 7 months ago
Fast Information Retrieval in a Self-Organising P2P Network
— In this paper we present a formal description of PROSA, a P2P resource management system heavily inspired by social networks. Social networks have been deeply studied in the la...
Vincenza Carchiolo, Michele Malgeri, Giuseppe Mang...
JCT
2007
96views more  JCT 2007»
13 years 7 months ago
Co-degree density of hypergraphs
For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r − 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of...
Dhruv Mubayi, Yi Zhao
JUCS
2007
148views more  JUCS 2007»
13 years 7 months ago
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
Adrian Dumitrescu, Csaba D. Tóth
CGF
2004
165views more  CGF 2004»
13 years 7 months ago
Point Cloud Collision Detection
In the past few years, many efficient rendering and surface reconstruction algorithms for point clouds have been developed. However, collision detection of point clouds has not be...
Jan Klein, Gabriel Zachmann