Sciweavers

67 search results - page 2 / 14
» Finding Even Cycles Even Faster
Sort
View
VLDB
2008
ACM
131views Database» more  VLDB 2008»
14 years 5 months ago
Primal or dual: which promises faster spatiotemporal search?
The existing predictive spatiotemporal indexes can be classified into two categories, depending on whether they are based on the primal or dual methodology. Although we have gaine...
Yufei Tao, Xiaokui Xiao
ASAP
2003
IEEE
124views Hardware» more  ASAP 2003»
13 years 10 months ago
Arbitrary Bit Permutations in One or Two Cycles
Symmetric-key block ciphers encrypt data, providing data confidentiality over the public Internet. For inter-operability reasons, it is desirable to support a variety of symmetric...
Zhijie Shi, Xiao Yang, Ruby B. Lee
AIPS
2008
13 years 7 months ago
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Katrina Ray, Matthew L. Ginsberg
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
13 years 7 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
ANTSW
2010
Springer
13 years 2 months ago
Autonomous Multi-agent Cycle Based Patrolling
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...
Yotam Elor, Alfred M. Bruckstein