Sciweavers

4850 search results - page 296 / 970
» Approximate Data Structures with Applications
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Spectral clustering for multi-type relational data
Clustering on multi-type relational data has attracted more and more attention in recent years due to its high impact on various important applications, such as Web mining, e-comm...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
DASFAA
2005
IEEE
136views Database» more  DASFAA 2005»
16 years 9 days ago
Distributed Intersection Join of Complex Interval Sequences
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
DAC
1996
ACM
15 years 10 months ago
A Sparse Image Method for BEM Capacitance Extraction
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...
Byron Krauter, Yu Xia, E. Aykut Dengi, Lawrence T....
COMPGEOM
2004
ACM
15 years 10 months ago
Continuous path verification in multi-axis NC-machining
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperi...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 4 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...