Sciweavers

317 search results - page 22 / 64
» Computing and Updating the Process Number in Trees
Sort
View
IPPS
2002
IEEE
15 years 6 months ago
Parallel Incremental 2D-Discretization on Dynamic Datasets
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
Srinivasan Parthasarathy, Arun Ramakrishnan
VLSID
2002
IEEE
136views VLSI» more  VLSID 2002»
16 years 1 months ago
Buffered Routing Tree Construction under Buffer Placement Blockages
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
Wei Chen, Massoud Pedram, Premal Buch
CVPR
2008
IEEE
16 years 3 months ago
A Parallel Decomposition Solver for SVM: Distributed dual ascend using Fenchel Duality
We introduce a distributed algorithm for solving large scale Support Vector Machines (SVM) problems. The algorithm divides the training set into a number of processing nodes each ...
Tamir Hazan, Amit Man, Amnon Shashua
ICNP
1998
IEEE
15 years 5 months ago
On-Demand Multicast in Mobile Wireless Networks
In this paper we propose an "on demand" multicast routing protocol for a wireless, mobile, multihop network. The proposed scheme has two key features: (a) it is based on...
Ching-Chuan Chiang, Mario Gerla
ICASSP
2008
IEEE
15 years 7 months ago
Wavelet-domain compressive signal reconstruction using a Hidden Markov Tree model
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...