Sciweavers

11949 search results - page 41 / 2390
» Some results on (a:b)-choosability
Sort
View
84
Voted
DAM
2006
116views more  DAM 2006»
15 years 21 days ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
CPC
2002
113views more  CPC 2002»
15 years 15 days ago
Some Inequalities For The Largest Eigenvalue Of A Graph
Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...
Vladimir Nikiforov
71
Voted
ADMA
2007
Springer
103views Data Mining» more  ADMA 2007»
15 years 6 months ago
Explorative Data Mining on Stock Data - Experimental Results and Findings
This paper presents our preliminary explorative data mining experiments on stock data. The experiments are performed using information gain evaluation, chi-square test and decision...
Lay-Ki Soon, Sang Ho Lee
ICRA
2003
IEEE
112views Robotics» more  ICRA 2003»
15 years 6 months ago
Cartesian impedance control of redundant robots: recent results with the DLR-light-weight-arms
— This paper addresses the problem of impedance control for flexible joint robots based on a singular perturbation approach. Some aspects of the impedance controller, which turn...
Alin Albu-Schäffer, Christian Ott, Udo Frese,...
95
Voted
FSTTCS
1993
Springer
15 years 4 months ago
Complexity Results for 1-safe Nets
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete f...
Allan Cheng, Javier Esparza, Jens Palsberg