Sciweavers

2192 search results - page 293 / 439
» Algorithms for Challenging Motif Problems
Sort
View
141
Voted
IPPS
2005
IEEE
15 years 9 months ago
Energy-Aware Task Scheduling: Towards Enabling Mobile Computing over MANETs
Enabling high performance, persistent mobile computing has recently become a very active research area. The widespread popularity of mobile computing devices, such as laptops, han...
Waleed Alsalih, Selim G. Akl, Hossam S. Hassanein
145
Voted
EVOW
2008
Springer
15 years 5 months ago
Divide, Align and Full-Search for Discovering Conserved Protein Complexes
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
Pavol Jancura, Jaap Heringa, Elena Marchiori
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 3 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
124
Voted
ADHOC
2007
122views more  ADHOC 2007»
15 years 3 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari
150
Voted
EOR
2010
88views more  EOR 2010»
15 years 3 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan