Sciweavers

1545 search results - page 298 / 309
» Opportunities in Opportunistic Computing
Sort
View
MM
2009
ACM
203views Multimedia» more  MM 2009»
14 years 2 months ago
Distance metric learning from uncertain side information with application to automated photo tagging
Automated photo tagging is essential to make massive unlabeled photos searchable by text search engines. Conventional image annotation approaches, though working reasonably well o...
Lei Wu, Steven C. H. Hoi, Rong Jin, Jianke Zhu, Ne...
PLDI
1998
ACM
14 years 2 months ago
Type-Based Alias Analysis
This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases. The second extends the first by u...
Amer Diwan, Kathryn S. McKinley, J. Eliot B. Moss
COMPSAC
1997
IEEE
14 years 2 months ago
Classifying Architectural Elements as a Foundation for Mechanism Matching
Building a system at the architectural level can be thought of as decomposition into components followed by a series of exercises in matching. Components must be composed with eac...
Rick Kazman, Paul C. Clements, Leonard J. Bass, Gr...
ACSAC
2007
IEEE
14 years 1 months ago
Distributed Secure Systems: Then and Now
The early 1980s saw the development of some rather sophisticated distributed systems. These were not merely networked file systems: rather, using remote procedure calls, hierarchi...
Brian Randell, John M. Rushby
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
14 years 1 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...