Sciweavers

21319 search results - page 402 / 4264
» An Approach for Method Reengineering
Sort
View
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
16 years 1 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
TCAD
2008
96views more  TCAD 2008»
15 years 6 months ago
An Implicit Approach to Minimizing Range-Equivalent Circuits
Abstract--Simplifying a combinational circuit while preserving its range has a variety of applications, such as combinational equivalence checking and random simulation. Previous a...
Yung-Chih Chen, Chun-Yao Wang
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
16 years 1 months ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...
KCAP
2005
ACM
16 years 10 days ago
An ontological approach to the construction of problem-solving models
Our ongoing work aims at defining an ontology-centered approach for building expertise models for the CommonKADS methodology. This approach (which is named "OntoKADS") i...
Sabine Bruaux, Gilles Kassel, Gilles Morel
ICDCS
2010
IEEE
15 years 8 months ago
Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
Dezun Dong, Yunhao Liu, Kebin Liu, Xiangke Liao