Sciweavers

708 search results - page 54 / 142
» Timing closure: the solution and its problems
Sort
View
CHI
2008
ACM
15 years 10 months ago
Biometric daemons: authentication via electronic pets
A well-known security and identification problem involves the creation of secure but usable identification and authentication tools that the user is fully motivated to adopt. We d...
Pamela Briggs, Patrick L. Olivier
TCS
2008
14 years 10 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy
AAIP
2009
14 years 11 months ago
Incremental Learning in Inductive Programming
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
Robert Henderson
SPAA
2004
ACM
15 years 3 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
ECOOPW
1999
Springer
15 years 2 months ago
Correct Composition of Design Components
In this paper, we describe a method for the composition of components that are relatively correct under a particular criterion. The notion of composition pattern is also introduce...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan