Sciweavers

19320 search results - page 3589 / 3864
» On the complexity of computing determinants
Sort
View
SIGGRAPH
1992
ACM
15 years 10 months ago
Re-tiling polygonal surfaces
This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at var...
Greg Turk
ANCS
2007
ACM
15 years 10 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
ASIACRYPT
2007
Springer
15 years 10 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
CF
2007
ACM
15 years 10 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
169
Voted
CHIMIT
2007
ACM
15 years 10 months ago
Network-centricity: hindered by hierarchical anchors
Network-centricity is a concept under consideration as a useful paradigm for complex organizational operations, combining the strengths of bureaucracy with the innovative possibil...
Steve Abrams, Gloria Mark
« Prev « First page 3589 / 3864 Last » Next »