Sciweavers

206 search results - page 35 / 42
» New Data Structures for Subgraph Connectivity
Sort
View
SIGIR
2004
ACM
14 years 1 months ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
VISUALIZATION
2002
IEEE
14 years 17 days ago
BLIC: Bi-Level Isosurface Compression
In this paper we introduce a new and simple algorithm to compress isosurface data. This is the data extracted by isosurface algorithms from scalar functions defined on volume gri...
Gabriel Taubin
CJ
2004
99views more  CJ 2004»
13 years 7 months ago
Filters for XML-based Service Discovery in Pervasive Computing
Pervasive computing refers to an emerging trend towards numerous casually accessible devices connected to an increasingly ubiquitous network infrastructure. An important challenge...
Georgia Koloniari, Evaggelia Pitoura
MKWI
2008
156views Business» more  MKWI 2008»
13 years 9 months ago
Enabling Open Innovation in a World of Ubiquitous Computing - Proposing a Research Agenda
: This article proposes a new Ubiquitous Computing (UC) infrastructure for open access to object data that will come along with a new research agenda especially for the field of Wi...
Detlef Schoder, Christian Schmitt, Kai Fischbach, ...
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 5 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu