Sciweavers

37 search results - page 7 / 8
» Where the Typical Set Partitions Meet and Join
Sort
View
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
14 years 1 months ago
Non-redundant Multi-view Clustering via Orthogonalization
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
Ying Cui, Xiaoli Z. Fern, Jennifer G. Dy
DAGSTUHL
2006
13 years 8 months ago
Taming Dynamic and Selfish Peers
This paper addresses two important challenges for current P2P systems, namely churn and selfishness. First, we report on a system [19] whose desirable properties (small peer degre...
Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, Rog...
ET
2002
122views more  ET 2002»
13 years 7 months ago
Using At-Speed BIST to Test LVDS Serializer/Deserializer Function
LVDS is the acronym for Low-Voltage-DifferentialSignaling and is described in both the ANSI/TIA/EIA644 and IEEE 1596.3 standards. High performance yet Low Power and EMI have made ...
Magnus Eckersand, Fredrik Franzon, Ken Filliter
PVLDB
2008
131views more  PVLDB 2008»
13 years 6 months ago
Learning to create data-integrating queries
The number of potentially-related data resources available for querying -- databases, data warehouses, virtual integrated schemas -continues to grow rapidly. Perhaps no area has s...
Partha Pratim Talukdar, Marie Jacob, Muhammad Salm...
VIS
2008
IEEE
192views Visualization» more  VIS 2008»
14 years 8 months ago
Smooth Surface Extraction from Unstructured Point-based Volume Data Using PDEs
Abstract--Smooth surface extraction using partial differential equations (PDEs) is a well-known and widely used technique for visualizing volume data. Existing approaches operate o...
Paul Rosenthal, Lars Linsen