Sciweavers

1187 search results - page 168 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
A new method for visual stylometry on impressionist paintings
A new emerging field, that of visual stylometry of art, proposes to apply image analysis and machine learning tools to high-resolution digital images of artwork in order to assis...
Hanchao Qi, Shannon Hughes
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
15 years 6 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
SIGGRAPH
1999
ACM
15 years 2 months ago
Computing Exact Shadow Irradiance Using Splines
We present a solution to the general problem of characterizing shadows in scenes involving a uniform polygonal area emitter and a polygonal occluder in arbitrary position by manif...
Michael M. Stark, Elaine Cohen, Tom Lyche, Richard...
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
15 years 4 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...
IEEEARES
2008
IEEE
15 years 4 months ago
Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
Zhiyao Liang, Rakesh M. Verma