Sciweavers

3467 search results - page 670 / 694
» Non-monotonic feature selection
Sort
View
AINA
2004
IEEE
15 years 3 months ago
An Efficient Clustered Architecture for P2P Networks
Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some ...
Juan Li, Son T. Vuong
CGO
2004
IEEE
15 years 3 months ago
Custom Data Layout for Memory Parallelism
In this paper, we describe a generalized approach to deriving a custom data layout in multiple memory banks for array-based computations, to facilitate high-bandwidth parallel mem...
Byoungro So, Mary W. Hall, Heidi E. Ziegler
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 3 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
CASES
2006
ACM
15 years 3 months ago
High-performance packet classification algorithm for many-core and multithreaded network processor
Packet classification is crucial for the Internet to provide more value-added services and guaranteed quality of service. Besides hardware-based solutions, many software-based cla...
Duo Liu, Bei Hua, Xianghui Hu, Xinan Tang
EMSOFT
2006
Springer
15 years 3 months ago
Multi-level software reconfiguration for sensor networks
In-situ reconfiguration of software is indispensable in embedded networked sensing systems. It is required for re-tasking a deployed network, fixing bugs, introducing new features...
Rahul Balani, Chih-Chieh Han, Ram Kumar Rengaswamy...