Sciweavers

9842 search results - page 1351 / 1969
» Problem complexity
Sort
View
CORR
2010
Springer
84views Education» more  CORR 2010»
15 years 7 months ago
On the Security of Non-Linear HB (NLHB) Protocol Against Passive Attack
As a variant of the HB authentication protocol for RFID systems, which relies on the complexity of decoding linear codes against passive attacks, Madhavan et al. presented Non-Line...
Mohammad Reza Sohizadeh Abyaneh
FUIN
2008
136views more  FUIN 2008»
15 years 7 months ago
Multi-Dimensional Relational Sequence Mining
The issue addressed in this paper concerns the discovery of frequent multi-dimensional patterns from relational sequences. The great variety of applications of sequential pattern m...
Floriana Esposito, Nicola Di Mauro, Teresa Maria A...
204
Voted
DAM
2007
177views more  DAM 2007»
15 years 7 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
227
Voted
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
15 years 7 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
BMCBI
2005
158views more  BMCBI 2005»
15 years 7 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
« Prev « First page 1351 / 1969 Last » Next »