Sciweavers

5606 search results - page 1025 / 1122
» Randomization Techniques for Graphs.
Sort
View
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 4 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
COMPGEOM
2006
ACM
15 years 4 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
VISUALIZATION
2005
IEEE
15 years 3 months ago
Topology-driven Surface Mappings with Robust Feature Alignment
Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not bee...
Christopher Carner, Miao Jin, Xianfeng Gu, Hong Qi...
AIRWEB
2005
Springer
15 years 3 months ago
Web Spam, Propaganda and Trust
Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. ...
Panagiotis Takis Metaxas, Joseph DeStefano
INFOVIS
2002
IEEE
15 years 3 months ago
Visualizing Data with Bounded Uncertainty
Visualization is a powerful way to facilitate data analysis, but it is crucial that visualization systems explicitly convey the presence, nature, and degree of uncertainty to user...
Chris Olston, Jock D. Mackinlay
« Prev « First page 1025 / 1122 Last » Next »