Sciweavers

5169 search results - page 206 / 1034
» Locality approximation using time
Sort
View
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
15 years 11 months ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...
ICRA
1995
IEEE
107views Robotics» more  ICRA 1995»
15 years 10 months ago
A Design Method of Local Communication Area in Multiple Mobile Robot System
When many mobile robots should achieve cooperation, local communication system is considered appropriate from the standpoint of the cost and capacity of communication. This paper ...
Eiichi Yoshida, Masakazu Yamamoto, Tamio Arai, Jun...
ICML
2004
IEEE
16 years 7 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
FOCS
2006
IEEE
16 years 11 days ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
15 years 11 months ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...