Sciweavers

CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 8 months ago
Discovering potential user browsing behaviors using custom-built apriori algorithm
Most of the organizations put information on the web because they want it to be seen by the world. Their goal is to have visitors come to the site, feel comfortable and stay a whi...
Sandeep Singh Rawat, Lakshmi Rajamani
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 8 months ago
A New Approach to Spreadsheet Analytics Management in Financial Markets
Spreadsheets in financial markets are frequently used as database, calculator and reporting application combined. This paper describes an alternative approach in which spreadsheet...
Brian Sentence
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 8 months ago
Dichotomy for tree-structured trigraph list homomorphism problems
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to...
Tomás Feder, Pavol Hell, David G. Schell, J...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 8 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye
CORR
2008
Springer
93views Education» more  CORR 2008»
13 years 8 months ago
Succinctness of the Complement and Intersection of Regular Expressions
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
Wouter Gelade, Frank Neven
CORR
2010
Springer
67views Education» more  CORR 2010»
13 years 8 months ago
Sustaining the Internet with Hyperbolic Mapping
Marián Boguñá, Fragkiskos Pap...
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 8 months ago
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
Abstract. The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability)...
Christian Glasser, Heinz Schmitz, Victor L. Seliva...
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 8 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Quantifying Homology Classes
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
Chao Chen, Daniel Freedman
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 8 months ago
On Geometric Spanners of Euclidean and Unit Disk Graphs
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
Iyad A. Kanj, Ljubomir Perkovic