Sciweavers

11565 search results - page 2033 / 2313
» Computing Minimal Mappings
Sort
View
FOCS
2000
IEEE
15 years 11 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
SPAA
1997
ACM
15 years 11 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
SIGGRAPH
1996
ACM
15 years 10 months ago
Simulating Facial Surgery Using Finite Element Models
This paper describes a prototype system for surgical planning and prediction of human facial shape after craniofacial and maxillofacial surgery for patients with facial deformitie...
Rolf M. Koch, Markus H. Gross, Friedrich R. Carls,...
SIGGRAPH
1994
ACM
15 years 10 months ago
Fast volume rendering using a shear-warp factorization of the viewing transformation
Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data slices, a projection to form an intermediate but ...
Philippe Lacroute, Marc Levoy
ANCS
2006
ACM
15 years 10 months ago
Efficient memory utilization on network processors for deep packet inspection
Deep Packet Inspection (DPI) refers to examining both packet header and payload to look for predefined patterns, which is essential for network security, intrusion detection and c...
Piti Piyachon, Yan Luo
« Prev « First page 2033 / 2313 Last » Next »