4913 search results - page 285 / 983 » Results and Perspectives of the G |
179
click to vote
MSWIM
2004
ACM
16 years 5 days ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
167
click to vote
KDD
1999
ACM
15 years 11 months ago
1999
ACM
Managers of electronic commerce sites need to learn as much as possible about their customers and those browsing their virtual premises, in order to maximise the return on marketin...
160
click to vote
SWAT
1998
Springer
15 years 11 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
203
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
193
click to vote
TRECVID
2008
15 years 8 months ago
2008
The Informedia team participated in the tasks of Rushes summarization, high-level feature extraction and event detection in surveillance video. For the rushes summarization, our b...