Sciweavers

10890 search results - page 1964 / 2178
» Automatic Complexity Analysis
Sort
View
SCN
2008
Springer
136views Communications» more  SCN 2008»
15 years 6 months ago
An efficient data structure for network anomaly detection
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
Jieyan Fan, Dapeng Wu, Kejie Lu, Antonio Nucci
PR
2006
101views more  PR 2006»
15 years 6 months ago
Efficient Legendre moment computation for grey level images
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
G. Y. Yang, Huazhong Shu, Christine Toumoulin, Guo...
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 6 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
PRESENCE
2006
104views more  PRESENCE 2006»
15 years 6 months ago
Physically Realistic Virtual Surgery Using the Point-Associated Finite Field (PAFF) Approach
The generation of multimodal virtual environments for surgical training is complicated by the necessity to develop heterogeneous simulation scenarios such as surgical incision, ca...
Suvranu De, Yi-Je Lim, Manivannan Muniyandi, Manda...
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
« Prev « First page 1964 / 2178 Last » Next »