Sciweavers

3466 search results - page 248 / 694
» Fast computation of special resultants
Sort
View
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
16 years 28 days ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
HUC
2005
Springer
16 years 8 days ago
A New Method for Auto-calibrated Object Tracking
Ubiquitous computing technologies which are cheap and easy to use are more likely to be adopted by users beyond the ubiquitous computing community. We present an ultrasonic-only tr...
Paul Duff, Michael R. McCarthy, Angus Clark, Henk ...
MICCAI
2008
Springer
16 years 8 months ago
Symmetric Log-Domain Diffeomorphic Registration: A Demons-Based Approach
Abstract. Modern morphometric studies use non-linear image registration to compare anatomies and perform group analysis. Recently, logEuclidean approaches have contributed to promo...
Tom Vercauteren, Xavier Pennec, Aymeric Perchant...
DAC
2003
ACM
16 years 7 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li
219
Voted
PDP
2010
IEEE
15 years 11 months ago
Distributed Scheduler of Workflows with Deadlines in a P2P Desktop Grid
Scheduling large amounts of tasks in distributed computing platforms composed of millions of nodes is a challenging goal, even more in a fully decentralized way and with low overhe...
Javier Celaya, Unai Arronategui