Sciweavers

2629 search results - page 495 / 526
» complex 2009
Sort
View
IWPEC
2009
Springer
15 years 4 months ago
Improved Induced Matchings in Sparse Graphs
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Wal...
IWSEC
2009
Springer
15 years 4 months ago
Improved Distinguishing Attacks on HC-256
The software-efficient stream cipher HC-256 was proposed by Wu at FSE 2004. Due to its impressive performance, the cipher was also a well-received entrant to the ECRYPT eSTREAM com...
Gautham Sekar, Bart Preneel
KSEM
2009
Springer
15 years 4 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
MDM
2009
Springer
150views Communications» more  MDM 2009»
15 years 4 months ago
Perimeter-Based Data Replication in Mobile Sensor Networks
—This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm. Our objectives are to explore a given geographic region by detecting spatio-temporal ev...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, M...
75
Voted
MFCS
2009
Springer
15 years 4 months ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...