Sciweavers

14165 search results - page 2683 / 2833
» The generalized two-server problem
Sort
View
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
16 years 7 days ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk
UPP
2004
Springer
16 years 7 days ago
From Prescriptive Programming of Solid-State Devices to Orchestrated Self-organisation of Informed Matter
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
Klaus-Peter Zauner
VIZSEC
2004
Springer
16 years 7 days ago
Managing attack graph complexity through visual hierarchical aggregation
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
Steven Noel, Sushil Jajodia
ECCV
2010
Springer
16 years 6 days ago
A Fast Dual Method for HIK SVM Learning
Histograms are used in almost every aspect of computer vi-4 4 sion, from visual descriptors to image representations. Histogram Inter-5 5 section Kernel (HIK) and SVM classifiers ...
ECCV
2010
Springer
16 years 6 days ago
Shape Analysis of Planar Objects with Arbitrary Topologies using Conformal Geometry
The study of 2D shapes is a central problem in the field of computer vision. In 2D shape analysis, classification and recognition of objects from their observed silhouette are e...
« Prev « First page 2683 / 2833 Last » Next »