Sciweavers

17688 search results - page 440 / 3538
» Data Set Balancing
Sort
View
CPM
2009
Springer
131views Combinatorics» more  CPM 2009»
15 years 10 months ago
Linear Time Suffix Array Construction Using D-Critical Substrings
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
Ge Nong, Sen Zhang, Wai Hong Chan
MOBISYS
2007
ACM
15 years 9 months ago
Automatic administration of the get up and go test
In-home monitoring using sensors has the potential to improve the life of elderly and chronically ill persons, assist their family and friends in supervising their status, and pro...
Dounia Berrada, Mario Romero, Gregory D. Abowd, Ma...
ANCS
2008
ACM
15 years 8 months ago
On runtime management in multi-core packet processing systems
Computer networks require increasingly complex packet processing in the data path to adapt to new functionality requirements. To meet performance demands, packet processing system...
Qiang Wu, Tilman Wolf
ASPDAC
2008
ACM
92views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Design space exploration for a coarse grain accelerator
- In the design process of a reconfigurable accelerator employing in an embedded system, multitude parameters may result in remarkable complexity and a large design space. Design s...
Farhad Mehdipour, Hamid Noori, Morteza Saheb Zaman...
ECML
2006
Springer
15 years 8 months ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev