Sciweavers

1675 search results - page 60 / 335
» Implementing Data Cubes Efficiently
Sort
View
PAKDD
2000
ACM
128views Data Mining» more  PAKDD 2000»
14 years 1 months ago
Efficient Detection of Local Interactions in the Cascade Model
Detection of interactions among data items constitutes an essential part of knowledge discovery. The cascade model is a rule induction methodology using levelwise expansion of a la...
Takashi Okada
HPCC
2010
Springer
13 years 11 months ago
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...
GLOBECOM
2008
IEEE
13 years 10 months ago
Highly Memory-Efficient LogLog Hash for Deep Packet Inspection
As the network line rates reach 40 Gbps today and 100 Gbps in the near future, performing deep packet inspection (DPI) in the Network Intrusion Detection and Prevention Systems (NI...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
FASE
2010
Springer
14 years 1 months ago
Efficient Runtime Assertion Checking of Assignable Clauses with Datagroups
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
Hermann Lehner, Peter Müller
ICCV
2009
IEEE
13 years 7 months ago
Efficient multi-label ranking for multi-class learning: Application to object recognition
Multi-label learning is useful in visual object recognition when several objects are present in an image. Conventional approaches implement multi-label learning as a set of binary...
Serhat Selcuk Bucak, Pavan Kumar Mallapragada, Ron...