Sciweavers

322 search results - page 39 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
OPODIS
2007
13 years 9 months ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei
STACS
1999
Springer
13 years 12 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
PAMI
2008
200views more  PAMI 2008»
13 years 7 months ago
Principal Component Analysis Based on L1-Norm Maximization
In data-analysis problems with a large number of dimension, principal component analysis based on L2-norm (L2PCA) is one of the most popular methods, but L2-PCA is sensitive to out...
Nojun Kwak
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
13 years 8 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...
COCOON
2003
Springer
14 years 27 days ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...