Sciweavers

3146 search results - page 186 / 630
» Efficient Consequence Finding
Sort
View
IJCAI
2003
15 years 7 months ago
On a generalization of triangulated graphs for domains decomposition of CSPs
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
Assef Chmeiss, Philippe Jégou, Lamia Keddar
BMCBI
2010
115views more  BMCBI 2010»
15 years 6 months ago
Non-coding RNA detection methods combined to improve usability, reproducibility and precision
Background: Non-coding RNAs gain more attention as their diverse roles in many cellular processes are discovered. At the same time, the need for efficient computational prediction...
Peter Raasch, Ulf Schmitz, Nadja Patenge, Julio Ve...
CGF
2010
112views more  CGF 2010»
15 years 6 months ago
Winding Roads: Routing edges into bundles
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
A. Lambert, Romain Bourqui, David Auber
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 6 months ago
CONCISE: Compressed 'n' Composable Integer Set
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
Alessandro Colantonio, Roberto Di Pietro
ISF
2006
161views more  ISF 2006»
15 years 6 months ago
Capturing and reusing knowledge in engineering change management: A case of automobile development
The development of complex products, such as automobiles, involves engineering changes that frequently require redesigning or altering the products. Although it has been found that...
Hong Joo Lee, Hyung Jun Ahn, Jong Woo Kim, Sung Jo...