Sciweavers

2745 search results - page 319 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
171
Voted
CSDA
2007
152views more  CSDA 2007»
15 years 6 months ago
Robust variable selection using least angle regression and elemental set sampling
In this paper we address the problem of selecting variables or features in a regression model in the presence of both additive (vertical) and leverage outliers. Since variable sel...
Lauren McCann, Roy E. Welsch
STOC
2002
ACM
91views Algorithms» more  STOC 2002»
16 years 6 months ago
New results on monotone dualization and generating hypergraph transversals
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
Thomas Eiter, Georg Gottlob, Kazuhisa Makino
160
Voted
SG
2005
Springer
15 years 11 months ago
Generation of Glyphs for Conveying Complex Information, with Application to Protein Representations
Abstract. We present a method to generate glyphs which convey complex information in graphical form. A glyph has a linear geometry which is specified using geometric operations, e...
Greg Pintilie, Brigitte Tuekam, Christopher W. V. ...
DAC
2001
ACM
16 years 7 months ago
High-Quality Operation Binding for Clustered VLIW Datapaths
Clustering is an effective method to increase the available parallelism in VLIW datapaths without incurring severe penalties associated with large number of register file ports. E...
Viktor S. Lapinskii, Margarida F. Jacome, Gustavo ...
152
Voted
ICPR
2002
IEEE
15 years 11 months ago
A Comparison of Techniques for Automatic Clustering of Handwritten Characters
This work reports experiments with four hierarchical clustering algorithms and two clustering indices for online handwritten characters. The main motivation of the work is to deve...
Vuokko Vuori, Jorma Laaksonen