Sciweavers

1272 search results - page 32 / 255
» The Set Cover with Pairs Problem
Sort
View
100
Voted
RSFDGRC
2009
Springer
119views Data Mining» more  RSFDGRC 2009»
15 years 7 months ago
Interval Set Cluster Analysis: A Re-formulation
A new clustering strategy is proposed based on interval sets, which is an alternative formulation different from the ones used in the existing studies. Instead of using a single s...
Yiyu Yao, Pawan Lingras, Ruizhi Wang, Duoqian Miao
PR
2000
82views more  PR 2000»
15 years 14 days ago
Holistic recognition of handwritten character pairs
Researchers have thus far focused on the recognition of alpha and numeric characters in isolation as well as in context. In this paper we introduce a new genre of problems where t...
Xian Wang, Venu Govindaraju, Sargur N. Srihari
175
Voted
MFCS
2010
Springer
14 years 11 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
DCOSS
2005
Springer
15 years 6 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
ECML
2006
Springer
15 years 4 months ago
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
Alexander N. Dolia, Tijl De Bie, Christopher J. Ha...