Sciweavers

1816 search results - page 325 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
LOGCOM
2010
120views more  LOGCOM 2010»
15 years 23 days ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
TIM
2010
144views Education» more  TIM 2010»
15 years 21 days ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
TMM
2010
199views Management» more  TMM 2010»
15 years 21 days ago
Video Annotation Through Search and Graph Reinforcement Mining
Abstract--Unlimited vocabulary annotation of multimedia documents remains elusive despite progress solving the problem in the case of a small, fixed lexicon. Taking advantage of th...
Emily Moxley, Tao Mei, Bangalore S. Manjunath
165
Voted
AINA
2011
IEEE
14 years 9 months ago
Exploring Multi-homing Issues in Heterogeneous Environments
—Mobile devices with two network interfaces (WiFi and 3G) are already commercially available. Pointto-point communications such as Infrared and Bluetooth are also readily used. I...
Glenford E. Mapp, Mahdi Aiash, Hélio Cresta...
DAC
2011
ACM
14 years 5 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting