Sciweavers

10599 search results - page 69 / 2120
» Measure Based Regularization
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 2 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
ISSS
2002
IEEE
142views Hardware» more  ISSS 2002»
14 years 1 months ago
Energy/Power Estimation of Regular Processor Arrays
We propose a high-level analytical model for estimating the energy and/or power dissipation in VLSI processor (systolic) array implementations of loop programs, particularly for i...
Sanjay V. Rajopadhye, Steven Derrien
STACS
2001
Springer
14 years 16 days ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
SIBGRAPI
2000
IEEE
13 years 11 months ago
Semi-Regular 4-8 Refinement and Box Spline Surfaces
Abstract. In this paper we introduce a new mesh refinement method for subdivision surfaces. It generates a semiregular 4-direction hierarchical structure from control meshes repres...
Luiz Velho
JCT
1998
122views more  JCT 1998»
13 years 7 months ago
Counting 1-Factors in Regular Bipartite Graphs
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
Alexander Schrijver