Sciweavers

2107 search results - page 333 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 6 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
ARITH
2009
IEEE
14 years 3 months ago
Unified Approach to the Design of Modulo-(2n +/- 1) Adders Based on Signed-LSB Representation of Residues
Moduli of the form 2n ± 1, which greatly simplify certain arithmetic operations in residue number systems (RNS), have been of longstanding interest. A steady stream of designs fo...
Ghassem Jaberipur, Behrooz Parhami
CLUSTER
2008
IEEE
14 years 3 months ago
Context-aware address translation for high performance SMP cluster system
—User-level communication allows an application process to access the network interface directly. Bypassing the kernel requires that a user process accesses the network interface...
Moon-Sang Lee, Joonwon Lee, Seungryoul Maeng
ICDCS
2008
IEEE
14 years 3 months ago
Routing of XML and XPath Queries in Data Dissemination Networks
XML-based data dissemination networks are rapidly gaining momentum. In these networks XML content is routed from data producers to data consumers throughout an overlay network of ...
Guoli Li, Shuang Hou, Hans-Arno Jacobsen
LCN
2008
IEEE
14 years 3 months ago
Priority interrupts of Duty Cycled communications in wireless sensor networks
— FrameComm is a contention based, Duty Cycled, MAC protocol that ensures a message will be transmitted during the receiver’s listen phase by sending a packet, followed by a sh...
Tony O'Donovan, Jonathan P. Benson, Utz Roedig, Co...