Sciweavers

7827 search results - page 1268 / 1566
» time 2007
Sort
View
COMPGEOM
2007
ACM
15 years 10 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary
CONEXT
2007
ACM
15 years 10 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
CONEXT
2007
ACM
15 years 10 months ago
BonSwing: A GUI framework for ad-hoc applications using service discovery
In typical single-link 802.11 ad-hoc networks, devices often move from one network to the next, forming transitory associations without a fixed support infrastructure. The state i...
Suman Srinivasan, Henning Schulzrinne
CONEXT
2007
ACM
15 years 10 months ago
Do you know what you are generating?
Software-based traffic generators are commonly used in experimental research on computer networks. However, there are no much studies focusing on how such instruments are accurate...
Alberto Dainotti, Alessio Botta, Antonio Pescap&eg...
CP
2007
Springer
15 years 10 months ago
On Inconsistent Clause-Subsets for Max-SAT Solving
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
« Prev « First page 1268 / 1566 Last » Next »