Sciweavers

9842 search results - page 1564 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
CCR
1999
92views more  CCR 1999»
15 years 6 months ago
YESSIR: a simple reservation mechanism for the Internet
Abstract-RSVP has been designed to support resource reservation in the Internet. However, it has two major problems: complexity and scalability. The former results in large message...
Ping Pan, Henning Schulzrinne
CN
1999
106views more  CN 1999»
15 years 6 months ago
UIML: An Appliance-Independent XML User Interface Language
Today's Internet appliances feature user interface technologies almost unknown a few years ago: touch screens, styli, handwriting and voice recognition, speech synthesis, tin...
Marc Abrams, Constantinos Phanouriou, Alan L. Bato...
CN
1999
128views more  CN 1999»
15 years 6 months ago
Intrusion detection systems as evidence
: Although the main aim of IDSs is to detect intrusions to prompt evasive measures, a further aim can be to supply evidence in criminal and civil legal proceedings. However the fea...
Peter Sommer
MOC
1998
93views more  MOC 1998»
15 years 6 months ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
PAMI
2002
122views more  PAMI 2002»
15 years 6 months ago
Analytic PCA Construction for Theoretical Analysis of Lighting Variability in Images of a Lambertian Object
We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Si...
Ravi Ramamoorthi
« Prev « First page 1564 / 1969 Last » Next »