Sciweavers

914 search results - page 179 / 183
» Branch and Bound on the Network Model
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SIGMOD
2005
ACM
178views Database» more  SIGMOD 2005»
14 years 7 months ago
Towards Effective Indexing for Very Large Video Sequence Database
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
Heng Tao Shen, Beng Chin Ooi, Xiaofang Zhou
ICC
2009
IEEE
159views Communications» more  ICC 2009»
14 years 2 months ago
fP2P-HN: A P2P-Based Route Optimization Solution for Mobile IP and NEMO Clients
— Wireless technologies are rapidly evolving and the users are demanding the possibility of changing its point of attachment to the Internet (i.e. default router) without breakin...
Albert Cabellos-Aparicio, Rubén Cuevas Rum&...
ATAL
2009
Springer
14 years 1 months ago
Perspectives and challenges of agent-based simulation as a tool for economics and other social sciences
This paper argues that the agent-based simulation approach is just the one appropriate to the social sciences (including economics). Although there were many predecessor approache...
Klaus G. Troitzsch
FOCS
2007
IEEE
14 years 1 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak