Sciweavers

3937 search results - page 638 / 788
» Questioning Ubiquitous Computing
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Aliased Register Allocation for Straight-Line Programs Is NP-Complete
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
Jonathan K. Lee, Jens Palsberg, Fernando Magno Qui...
ICALP
2007
Springer
14 years 2 months ago
Parameterized Algorithms for Directed Maximum Leaf Problems
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
CVPR
2010
IEEE
14 years 2 months ago
Putting local features on a Manifold
Local features have proven very useful for recognition. Manifold learning has proven to be a very powerful tool in data analysis. However, manifold learning application for imag...
Marwan Torki and Ahmed Elgammal
ILP
2007
Springer
14 years 2 months ago
Learning to Assign Degrees of Belief in Relational Domains
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
Frédéric Koriche
ISPEC
2007
Springer
14 years 2 months ago
An Economical Model for the Risk Evaluation of DoS Vulnerabilities in Cryptography Protocols
Denial of Service (DoS) attacks are a virulent type of attack on the availability of networks’ intended services and resources. Defense against DoS attacks has been built into th...
Zhen Cao, Zhi Guan, Zhong Chen, Jian-bin Hu, Liyon...