Sciweavers

455 search results - page 76 / 91
» On Trees and Noncrossing Partitions
Sort
View
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
14 years 2 months ago
Mining in a mobile environment
Distributed PRocessing in Mobile Environments (DPRiME) is a framework for processing large data sets across an ad-hoc network. Developed to address the shortcomings of Google’s ...
Sean McRoskey, James Notwell, Nitesh V. Chawla, Ch...
FOCS
2008
IEEE
14 years 2 months ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
ICPR
2008
IEEE
14 years 2 months ago
Finding the splitting vector for image resolution up-conversion
This paper proposes a new single-frame image upconversion approach that uses prior information. The proposed method overcomes the drawbacks of the Kondo 2001 where the class membe...
Xinyu Xu, Hao Pan
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
14 years 2 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
WETICE
2007
IEEE
14 years 2 months ago
A Dominating Set Based Peer-to-Peer Protocol for Real-Time Multi-source Collaboration
Designing a collaborative architecture for real-time applications is an intricate challenge that usually involves dealing with the real-time constraints, resource limitations and ...
Dewan Tanvir Ahmed, Shervin Shirmohammadi, Abdulmo...