Sciweavers

526 search results - page 69 / 106
» On the Number of Minimal Addition Chains
Sort
View
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
15 years 4 months ago
A Global k-Level Crossing Reduction Algorithm
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
IPSN
2009
Springer
15 years 4 months ago
Improving the speed and scalability of distributed simulations of sensor networks
Distributed simulation techniques are commonly used to improve the speed and scalability of wireless sensor network simulators. However, accurate simulations of dynamic interactio...
Zhong-Yi Jin, Rajesh K. Gupta
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 4 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
48
Voted
DATE
2009
IEEE
76views Hardware» more  DATE 2009»
15 years 4 months ago
LFSR-based test-data compression with self-stoppable seeds
—The main disadvantage of LFSR-based compression is that it should be usually combined with a constrained ATPG process, and, as a result, it cannot be effectively applied to IP c...
M. Koutsoupia, Emmanouil Kalligeros, Xrysovalantis...
ICRA
2009
IEEE
164views Robotics» more  ICRA 2009»
15 years 4 months ago
Assigning cameras to subjects in video surveillance systems
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
Hazem El-Alfy, David Jacobs, Larry Davis