CORR 2008 - PDF Preprint Papers

CORR 2008 Workshop on Service Oriented Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CORR-2008 Paper

click to vote

CORR
2008
Springer

475views Education» more CORR 2008»

Survey of Technologies for Web Application Development

13 years 11 months ago

Download www.isr.uci.edu

Barry Doyle, Cristina Videira Lopes

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	475	Survey of Technologies for Web Application Development	claim
2	375	The Margitron: A Generalised Perceptron with Margin	claim
3	234	Bayesian Compressive Sensing via Belief Propagation	claim
4	233	3D Face Recognition with Sparse Spherical Representations	claim
5	227	An experimental analysis of Lemke-Howson algorithm	claim
6	217	A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks	claim
7	216	Building an interpretable fuzzy rule base from data using Orthogonal Least Squares Application to a depollution problem	claim
8	213	Between conjecture and memento: shaping a collective emotional perception of the future	claim
9	212	Joint Adaptive Modulation-Coding and Cooperative ARQ for Wireless Relay Networks	claim
10	211	Competitive Design of Multiuser MIMO Systems based on Game Theory: A Unified View	claim
11	208	Equilibria, Fixed Points, and Complexity Classes	claim
12	197	Sequential adaptive compressed sampling via Huffman codes	claim
13	194	Combining geometry and combinatorics: A unified approach to sparse signal recovery	claim
14	194	Fabrication of 3D Packaging TSV using DRIE	claim
15	193	Faster and better: a machine learning approach to corner detection	claim
16	192	Anomaly Detection in Streaming Sensor Data	claim
17	190	Chain-Based Representations for Solid and Physical Modeling	claim
18	189	Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio	claim
19	188	Citation Counting, Citation Ranking, and h-Index of Human-Computer Interaction Researchers: A Comparison between Scopus and Web of Science	claim
20	187	Securing U-Healthcare Sensor Networks using Public Key Based Scheme	claim
21	187	Coalitions in Cooperative Wireless Networks	claim
22	187	Efficient Interpolation in the Guruswami-Sudan Algorithm	claim
23	186	Greedy Signal Recovery Review	claim
24	185	Realizing Fast, Scalable and Reliable Scientific Computations in Grid Environments	claim
25	181	Hierarchical Grid-Based Pairwise Key Pre-distribution in Wireless Sensor Networks	claim
26	179	Practical Automated Partial Verification of Multi-Paradigm Real-Time Models	claim
27	179	Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication	claim
28	179	Induction and Co-induction in Sequent Calculus	claim
29	179	Realistic Haptic Rendering of Interacting Deformable Objects in Virtual Environments	claim
30	178	Model-Based Compressive Sensing	claim
31	177	Toeplitz Block Matrices in Compressed Sensing	claim
32	176	Analysis of Social Voting Patterns on Digg	claim
33	176	An evaluation of Bradfordizing effects	claim
34	175	Energy Aware Self-Organizing Density Management in Wireless Sensor Networks	claim
35	174	Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget	claim
36	173	Decomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications	claim
37	172	Lecture notes on the lambda calculus	claim
38	172	Altruism in Congestion Games	claim
39	170	To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?	claim
40	170	Fast Wavelet-Based Visual Classification	claim
41	169	Congestion Reduction Using Ad hoc Message Dissemination in Vehicular Networks	claim
42	169	Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem	claim
43	167	Fast k Nearest Neighbor Search using GPU	claim
44	167	Energy Scaling Laws for Distributed Inference in Random Networks	claim
45	166	Information-Theoretically Secure Voting Without an Honest Majority	claim
46	165	Feature Selection By KDDA For SVM-Based MultiView Face Recognition	claim
47	164	Joint Physical Layer Coding and Network Coding for Bi-Directional Relaying	claim
48	163	From Altruism to Non-Cooperation in Routing Games	claim
49	162	Compressed Modular Matrix Multiplication	claim
50	162	Accelerating Scientific Computations with Mixed Precision Algorithms	claim
51	162	Welfare Undominated Groves Mechanisms	claim
52	161	Compressed Sensing of Analog Signals	claim
53	161	An application of the Threshold Accepting metaheuristic for curriculum based course timetabling	claim
54	160	Degrees of Freedom of the MIMO Interference Channel with Cooperation and Cognition	claim
55	159	Privacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data	claim
56	159	Stochastic Limit-Average Games are in EXPTIME	claim
57	159	Compound Multiple Access Channels with Partial Cooperation	claim
58	159	Face Detection Using Adaboosted SVM-Based Component Classifier	claim
59	158	Distributed and Recursive Parameter Estimation in Parametrized Linear State-Space Models	claim
60	158	Community Detection using a Measure of Global Influence	claim
61	158	Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell	claim
62	158	Improved Smoothed Analysis of the k-Means Method	claim
63	157	The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms	claim
64	157	Achievable Throughput of Multi-mode Multiuser MIMO with Imperfect CSI Constraints	claim
65	156	Artificial Immune Systems (AIS) - A New Paradigm for Heuristic Decision Making	claim
66	156	Wireless Sensor/Actuator Network Design for Mobile Control Applications	claim
67	156	Pairing Functions, Boolean Evaluation and Binary Decision Diagrams	claim
68	155	Weighted Sum Rate Optimization for Cognitive Radio MIMO Broadcast Channels	claim
69	155	On Wiretap Networks II	claim
70	155	AceWiki: A Natural and Expressive Semantic Wiki	claim
71	155	Software dependability modeling using an industry-standard architecture description language	claim
72	154	Sponsored Search Auctions with Markovian Users	claim
73	154	Fuzzy Logic Control Based QoS Management in Wireless Sensor/Actuator Networks	claim
74	154	A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes	claim
75	154	Coinductive Formal Reasoning in Exact Real Arithmetic	claim
76	154	Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes	claim
77	154	On Pure and (approximate) Strong Equilibria of Facility Location Games	claim
78	154	Best-Effort Strategies for Losing States	claim
79	153	A Truthful Mechanism for Offline Ad Slot Scheduling	claim
80	153	Decomposition Techniques for Subgraph Matching	claim
81	153	Efficient and Robust Secure Aggregation for Sensor Networks	claim
82	153	Combining Semantic Wikis and Controlled Natural Language	claim
83	153	LACK - a VoIP Steganographic Method	claim
84	152	It's Not What You Have, But How You Use It: Compromises in Mobile Device Use	claim
85	152	An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines	claim
86	152	Characterizing User Mobility in Second Life	claim
87	151	Geometric Set Cover and Hitting Sets for Polytopes in $R^3$	claim
88	151	CoSaMP: Iterative signal recovery from incomplete and inaccurate samples	claim
89	151	Identifying 'Hidden' Communities of Practice within Electronic Networks: Some Preliminary Premises	claim
90	151	Exact Matrix Completion via Convex Optimization	claim
91	151	Checking the Quality of Clinical Guidelines using Automated Reasoning Tools	claim
92	151	Estimating the Lengths of Memory Words	claim
93	150	A Local Mean Field Analysis of Security Investments in Networks	claim
94	150	A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth	claim
95	150	Message-passing for Maximum Weight Independent Set	claim
96	150	Enhanced Energy-Aware Feedback Scheduling of Embedded Control Systems	claim
97	149	Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise	claim
98	149	Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application	claim
99	149	MIMO Networks: the Effects of Interference	claim
100	148	The craft of model making: PSPACE bounds for non-iterative modal logics	claim
101	148	Copper Electrodeposition for 3D Integration	claim
102	148	Integrating Job Parallelism in Real-Time Scheduling Theory	claim
103	148	A Non-differential Distributed Space-Time Coding for Partially-Coherent Cooperative Communication	claim
104	148	Conversion/Preference Games	claim
105	148	Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo	claim
106	147	Impact of CSI on Distributed Space-Time Coding in Wireless Relay Networks	claim
107	147	Automatic Contour Extraction from 2D Neuron Images	claim
108	147	C-K-R Partitions of Sparse Graphs	claim
109	147	A Minimum Relative Entropy Principle for Learning and Acting	claim
110	146	A distributed algorithm for computing and updating the process number of a forest	claim
111	146	Intrusion Detection Using Cost-Sensitive Classification
112	145	The Capacity Region of Large Wireless Networks	claim
113	145	Decentralized Overlay for Federation of Enterprise Clouds	claim
114	145	The Complexity of Weighted Boolean #CSP with Mixed Signs	claim
115	144	Modular Compilation of a Synchronous Language	claim
116	144	Iterative Hard Thresholding for Compressed Sensing	claim
117	144	Cooperation with Complement is Better	claim
118	143	On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks	claim
119	143	Convergence Thresholds of Newton's Method for Monotone Polynomial Equations	claim
120	143	Joint Source Channel Coding with Side Information Using Hybrid Digital Analog Codes	claim
121	143	A Type System for Data-Flow Integrity on Windows Vista	claim
122	143	A chain dictionary method for Word Sense Disambiguation and applications	claim
123	143	On combinations of local theory extensions	claim
124	143	Maximally Radio-Disjoint Multipath Routing for Wireless Multimedia Sensor Networks	claim
125	143	Locally computable approximations for spectral clustering and absorption times of random walks	claim
126	143	Join Bayes Nets: A new type of Bayes net for relational data	claim
127	142	Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell	claim
128	142	A Gaussian Belief Propagation Solver for Large Scale Support Vector Machines	claim
129	142	On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel	claim
130	142	Social networks that matter: Twitter under the microscope	claim
131	142	The Impact of QoS Constraints on the Energy Efficiency of Fixed-Rate Wireless Transmissions	claim
132	142	A Join Index for XML Data Warehouses	claim
133	141	Automatic Verification of Correspondences for Security Protocols	claim
134	141	Obfuscated Drawings of Planar Graphs	claim
135	141	Cryptanalysis of Yang-Wang-Chang's Password Authentication Scheme with Smart Cards	claim
136	141	Truthful Unsplittable Flow for Large Capacity Networks	claim
137	141	Distributed Source Coding using Abelian Group Codes	claim
138	141	Model checking memoryful linear-time logics over one-counter automata	claim
139	140	Encapsulation theory fundamentals	claim
140	140	A Cloning Pushout Approach to Term-Graph Transformation	claim
141	140	Prospective Study for Semantic Inter-Media Fusion in Content-Based Medical Image Retrieval	claim
142	140	Adaptive Spam Detection Inspired by a Cross-Regulation Model of Immune Dynamics: A Study of Concept Drift	claim
143	140	An Empirical Study of End-User Behaviour in Spreadsheet Error Detection & Correction	claim
144	140	Steganography of VoIP streams	claim
145	139	Generalized Traveling Salesman Problem Reduction Algorithms	claim
146	139	The Secrecy Graph and Some of its Properties	claim
147	139	Distance Distributions in Finite Uniformly Random Networks: Theory and Applications	claim
148	139	Exact two-terminal reliability of some directed networks	claim
149	138	Capacity Bounds for the Gaussian Interference Channel	claim
150	138	Order-Optimal Consensus through Randomized Path Averaging	claim
151	138	Computing Minimum Spanning Trees with Uncertainty	claim
152	138	On the Capacity of Free-Space Optical Intensity Channels	claim
153	138	The implicit equation of a canal surface	claim
154	138	An Improved Robust Fuzzy Extractor	claim
155	138	Efficient Implementation of the Generalized Tunstall Code Generation Algorithm	claim
156	137	Communications in cellular automata	claim
157	137	Combining generic judgments with recursive definitions	claim
158	137	On the Complexity of Nash Equilibria of Action-Graph Games	claim
159	137	Design and Implementation Aspects of a novel Java P2P Simulator with GUI	claim
160	137	Counteracting Byzantine Adversaries with Network Coding: An Overhead Analysis	claim
161	137	Transmission of Correlated Sources Over Multi-user Channels	claim
162	137	Evaluation of an Intelligent Assistive Technology for Voice Navigation of Spreadsheets	claim
163	136	Matrix Graph Grammars	claim
164	136	Distributed Sensor Localization in Random Environments using Minimal Number of Anchor Nodes	claim
165	136	Data Fusion Trees for Detection: Does Architecture Matter?	claim
166	136	Multi-Armed Bandits in Metric Spaces	claim
167	136	On the Capacity and Generalized Degrees of Freedom of the X Channel	claim
168	136	Networked MIMO with Clustered Linear Precoding	claim
169	135	Crossing Borders: Security and Privacy Issues of the European e-Passport	claim
170	135	The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace	claim
171	135	Conditional probability based significance tests for sequential patterns in multi-neuronal spike trains	claim
172	135	A DCCP Congestion Control Mechanism for Wired- cum-Wireless Environments	claim
173	135	Probabilistic SVM/GMM Classifier for Speaker-Independent Vowel Recognition in Continues Speech	claim
174	134	Implementation of perception and action at nanoscale	claim
175	134	Online Ad Slotting With Cancellations	claim
176	134	Algorithmic Based Fault Tolerance Applied to High Performance Computing	claim
177	133	On Geometric Spanners of Euclidean and Unit Disk Graphs	claim
178	133	Network Coding for Speedup in Switches	claim
179	133	A New Stream Cipher: Dicing	claim
180	133	Approximation Algorithms for Shortest Descending Paths in Terrains	claim
181	133	Faceted Ranking of Egos in Collaborative Tagging Systems	claim
182	133	Estimating divergence functionals and the likelihood ratio by convex risk minimization	claim
183	133	A simple local 3-approximation algorithm for vertex cover	claim
184	133	Emergence of Spontaneous Order Through Neighborhood Formation in Peer-to-Peer Recommender Systems	claim
185	133	From Multi-Keyholes to Measure of Correlation and Power Imbalance in MIMO Channels: Outage Capacity Analysis	claim
186	133	Computing voting power in easy weighted voting games	claim
187	132	Building Better Nurse Scheduling Algorithms	claim
188	132	Betweenness Centrality : Algorithms and Lower Bounds	claim
189	132	Materialized View Selection by Query Clustering in XML Data Warehouses	claim
190	132	Dynamic Rate Allocation in Fading Multiple-access Channels	claim
191	132	Trading GRH for algebra: algorithms for factoring polynomials and related structures	claim
192	132	Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes	claim
193	131	Quantized Multimode Precoding in Spatially Correlated Multi-Antenna Channels	claim
194	131	Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs	claim
195	131	Optimizing polynomials for floating-point implementation	claim
196	131	Jamming in Fixed-Rate Wireless Systems with Power Constraints - Part I: Fast Fading Channels	claim
197	131	Parameter Identification of Pressure Sensors by Static and Dynamic Measurements	claim
198	131	Towards a More Accurate Carrier Sensing Model for CSMA Wireless Networks	claim
199	130	Multicast Capacity of Optical WDM Packet Ring for Hotspot Traffic	claim
200	130	Asymptotically Good LDPC Convolutional Codes Based on Protographs	claim
201	130	A Kernel Method for the Two-Sample Problem	claim
202	130	Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel	claim
203	130	Convex Hull of Arithmetic Automata	claim
204	130	Standard Logics Are Valuation-Nonmonotonic	claim
205	130	Spectrum Allocation in Two-Tier Networks	claim
206	129	Factoring Polynomials over Finite Fields using Balance Test	claim
207	129	Tight Bounds on the Capacity of Binary Input random CDMA Systems	claim
208	129	Evolving Dynamic Change and Exchange of Genotype Encoding in Genetic Algorithms for Difficult Optimization Problems	claim
209	129	On the Stretch Factor of Convex Delaunay Graphs	claim
210	129	Combining Beamforming and Space-Time Coding Using Noisy Quantized Feedback	claim
211	129	Feature Unification in TAG Derivation Trees	claim
212	129	On the Capacity of Wireless Multicast Networks	claim
213	129	Steganographic Routing in Multi Agent System Environment	claim
214	129	Multi Site Coordination using a Multi-Agent System	claim
215	129	Bounds on Codes Based on Graph Theory	claim
216	129	Hierarchical Bayesian sparse image reconstruction with application to MRFM	claim
217	129	Linear Time Encoding of LDPC Codes	claim
218	129	Polynomial Linear Programming with Gaussian Belief Propagation	claim
219	129	A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem	claim
220	128	A Quantifier Elimination Algorithm for Linear Real Arithmetic	claim
221	128	Distributed Consensus over Wireless Sensor Networks Affected by Multipath Fading	claim
222	128	Reasoning in Abella about Structural Operational Semantics Specifications	claim
223	128	Diversity-Multiplexing Tradeoff in Selective-Fading Multiple-Access MIMO Channels	claim
224	128	Fork Sequential Consistency is Blocking	claim
225	128	Classification of curves in 2D and 3D via affine integral signatures	claim
226	128	Opportunistic Collaborative Beamforming with One-Bit Feedback	claim
227	128	A Fast Generic Sequence Matching Algorithm	claim
228	128	Efficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes	claim
229	128	Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination	claim
230	128	Electricity Demand and Energy Consumption Management System	claim
231	128	Informed stego-systems in active warden context: statistical undetectability and capacity	claim
232	127	Branching proofs of infeasibility in low density subset sum problems	claim
233	127	Asymptotically Optimum Universal One-Bit Watermarking for Gaussian Covertexts and Gaussian Attacks	claim
234	127	Comparing and Combining Methods for Automatic Query Expansion	claim
235	127	MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem	claim
236	127	Achieving Near-Capacity at Low SNR on a Multiple-Antenna Multiple-User Channel	claim
237	127	Intrusion Detection in Mobile Ad Hoc Networks Using Classification Algorithms	claim
238	127	Energy-Efficient Resource Allocation in Multiuser MIMO Systems: A Game-Theoretic Framework	claim
239	127	Theory of Rumour Spreading in Complex Social Networks	claim
240	127	A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting	claim
241	127	Adaptive Base Class Boost for Multi-class Classification	claim
242	127	On the long time behavior of the TCP window size process	claim
243	127	Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks	claim
244	127	Flexible Time-Triggered Sampling in Smart Sensor-Based Wireless Control Systems	claim
245	126	Intrinsically Universal Cellular Automata	claim
246	126	A Particular Universal Cellular Automaton	claim
247	126	Path following algorithm for the graph matching problem	claim
248	126	Approximate Capacity of Gaussian Relay Networks	claim
249	126	3D Building Model Fitting Using A New Kinetic Framework	claim
250	126	One shot schemes for decentralized quickest change detection	claim
251	126	Interference Channels with Correlated Receiver Side Information	claim
252	126	Non-Negative Matrix Factorization, Convexity and Isometry	claim
253	126	A TLA+ Proof System	claim
254	126	MIMO Two-way Relay Channel: Diversity-Multiplexing Tradeoff Analysis	claim
255	126	Mining User Profiles to Support Structure and Explanation in Open Social Networking	claim
256	125	Sensing Danger: Innate Immunology for Intrusion Detection	claim
257	125	Data Reduction in Intrusion Alert Correlation	claim
258	125	Adversary lower bounds for nonadaptive quantum algorithms	claim
259	125	Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields	claim
260	125	Power Control in Cognitive Radio Networks: How to Cross a Multi-Lane Highway	claim
261	125	Spreadsheet End-User Behaviour Analysis	claim
262	125	Semidefinite programming for N-Player Games	claim
263	125	Cross-Layer Link Adaptation Design for Relay Channels with Cooperative ARQ Protocol	claim
264	125	Cryptanalysis of the RSA-CEGD protocol	claim
265	124	High Performance Cooperative Transmission Protocols Based on Multiuser Detection and Network Coding	claim
266	124	A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach	claim
267	124	Scheduling Kalman Filters in Continuous Time	claim
268	123	On the graph isomorphism problem	claim
269	123	Networks become navigable as nodes move and forget	claim
270	123	Optimizing Web Sites for Customer Retention	claim
271	123	Large MIMO Detection: A Low-Complexity Detector at High Spectral Efficiencies	claim
272	123	Provenance Traces	claim
273	123	Inference of Flow Statistics via Packet Sampling in the Internet	claim
274	123	High Density Through Silicon Via (TSV)	claim
275	122	Breaking One-Round Key-Agreement Protocols in the Random Oracle Model	claim
276	122	Exploring Human Factors in Spreadsheet Development	claim
277	122	From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures	claim
278	122	Strategy Improvement for Concurrent Safety Games	claim
279	122	Simulations between triangular and hexagonal number-conserving cellular automata	claim
280	122	To Code or Not To Code in Multi-Hop Relay Channels	claim
281	121	The Forgiving Tree: A Self-Healing Distributed Data Structure	claim
282	121	On the Application of Hierarchical Coevolutionary Genetic Algorithms: Recombination and Evaluation Partners	claim
283	121	Cascaded Orthogonal Space-Time Block Codes for Wireless Multi-Hop Relay Networks	claim
284	121	Graph Algorithms for Improving Type-Logical Proof Search	claim
285	121	Separability in the Ambient Logic	claim
286	121	Rate-Distortion via Markov Chain Monte Carlo	claim
287	120	On the Complexity of Elementary Modal Logics	claim
288	120	Guarding curvilinear art galleries with vertex or point guards	claim
289	120	Distributed Joint Source-Channel Coding on a Multiple Access Channel with Side Information	claim
290	120	Cache-Oblivious Selection in Sorted X+Y Matrices	claim
291	120	Detecting Errors in Spreadsheets	claim
292	120	Codeword-Independent Performance of Nonbinary Linear Codes Under Linear-Programming and Sum-Product Decoding	claim
293	120	Menger's Paths with Minimum Mergings	claim
294	120	Optimal Energy Management Policies for Energy Harvesting Sensor Nodes	claim
295	120	A new distance for high level RNA secondary structure comparison	claim
296	120	XQuery Join Graph Isolation	claim
297	120	Automorphisms of doubly-even self-dual binary codes	claim
298	120	Network Protection Codes: Providing Self-healing in Autonomic Networks Using Network Coding	claim
299	119	On the Relationship between Transmission Power and Capacity of an Underwater Acoustic Communication Channel	claim
300	119	Capacity of the Discrete-Time AWGN Channel Under Output Quantization	claim
301	119	Atlas-Based Prostate Segmentation Using an Hybrid Registration	claim
302	119	BER and Outage Probability Approximations for LMMSE Detectors on Correlated MIMO Channels	claim
303	119	A maximum entropy approach to OFDM channel estimation	claim
304	119	Self-stabilizing Numerical Iterative Computation	claim
305	119	Learning Low Rank Matrices from O(n) Entries	claim
306	119	Prototyping and Performance Analysis of a QoS MAC Layer for Industrial Wireless Network	claim
307	119	Unified storage systems for distributed Tier-2 centres	claim
308	118	Security for Wiretap Networks via Rank-Metric Codes	claim
309	118	The price of certainty: "waterslide curves" and the gap to capacity	claim
310	118	Descent methods for Nonnegative Matrix Factorization	claim
311	118	Strategic Alert Throttling for Intrusion Detection Systems	claim
312	118	On Affinity Measures for Artificial Immune System Movie Recommenders	claim
313	118	Quantifying Homology Classes	claim
314	118	A Logic Programming Framework for Combinational Circuit Synthesis	claim
315	118	Learning Low-Density Separators	claim
316	118	List Decoding of Burst Errors	claim
317	118	An Activity-Based Model for Separation of Duty	claim
318	118	Distributed Constrained Optimization with Semicoordinate Transformations	claim
319	118	Correlated Equilibria in Continuous Games: Characterization and Computation	claim
320	118	Sum Rate Maximization using Linear Precoding and Decoding in the Multiuser MIMO Downlink	claim
321	118	Decentralized Search with Random Costs	claim
322	118	TrustMAS: Trusted Communication Platform for Multi-Agent Systems	claim
323	117	Capacity of Sparse Wideband Channels with Partial Channel Feedback	claim
324	117	Time Warp Edit Distance	claim
325	117	Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping	claim
326	117	A High Performance Memory Database for Web Application Caches	claim
327	117	Design, Fabrication and Characterization of a Piezoelectric Microgenerator Including a Power Management Circuit	claim
328	117	Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC	claim
329	117	Complexity of Decoding Positive-Rate Reed-Solomon Codes	claim
330	116	A statistical mechanical interpretation of algorithmic information theory	claim
331	116	Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks	claim
332	116	On the Computation of the Topology of a Non-Reduced Implicit Space Curve	claim
333	116	High-Resolution Radar via Compressed Sensing	claim
334	116	Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths	claim
335	116	The finite harmonic oscillator and its applications to sequences, communication and radar	claim
336	116	A computational approach to the covert and overt deployment of spatial attention	claim
337	116	An Evidential Path Logic for Multi-Relational Networks	claim
338	116	Binding bigraphs as symmetric monoidal closed theories	claim
339	116	To which extend is the "neural code" a metric ?	claim
340	116	Topological Dynamics of Cellular Automata: Dimension Matters	claim
341	116	Learning to rank with combinatorial Hodge theory	claim
342	116	Group representation design of digital signals and sequences	claim
343	116	Polynomial Filtering for Fast Convergence in Distributed Consensus	claim
344	116	The aDORe Federation Architecture	claim
345	116	Condition Numbers of Gaussian Random Matrices	claim
346	115	Playing With Population Protocols	claim
347	115	Kolmogorov complexity in perspective	claim
348	115	Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design	claim
349	115	Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels	claim
350	115	Spanning directed trees with many leaves	claim
351	115	New probabilistic interest measures for association rules	claim
352	115	Discrete schemes for Gaussian curvature and their convergence	claim
353	115	Coding over an Erasure Channel with a Large Alphabet Size	claim
354	115	Compound Node-Kayles on Paths	claim
355	115	Approximating Multi-Criteria Max-TSP	claim
356	115	New Guidelines For Spreadsheets	claim
357	115	Positive circuits and maximal number of fixed points in discrete dynamical systems	claim
358	115	Lower Bounds on the Rate-Distortion Function of LDGM Codes	claim
359	115	Determining the Unithood of Word Sequences using Mutual Information and Independence Measure	claim
360	115	On the dynamics of Social Balance on general networks (with an application to XOR-SAT)	claim
361	115	Efficient Navigation in Scale-Free Networks Embedded in Hyperbolic Metric Spaces	claim
362	114	Self-Assembly of Infinite Structures	claim
363	114	Multiparty Communication Complexity of Disjointness	claim
364	114	Investigating the Potential of Test-Driven Development for Spreadsheet Engineering	claim
365	114	Support Vector Machine Classification with Indefinite Kernels	claim
366	114	Network-based consensus averaging with general noisy channels	claim
367	114	Bits through ARQs	claim
368	114	DescribeX: A Framework for Exploring and Querying XML Web Collections	claim
369	114	Modeling Time in Computing: A Taxonomy and a Comparative Survey	claim
370	114	Algorithmic Pricing via Virtual Valuations	claim
371	114	Dynamic index selection in data warehouses	claim
372	114	The Equivalence of Semidefinite Relaxation MIMO Detectors for Higher-Order QAM	claim
373	114	A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables	claim
374	114	Temporal Support of Regular Expressions in Sequential Pattern Mining	claim
375	113	Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks	claim
376	113	Robustness, Risk, and Regularization in Support Vector Machines	claim
377	113	Generalized Modal Satisfiability	claim
378	113	Rateless Coding for MIMO Block Fading Channels	claim
379	113	Clustering of scientific citations in Wikipedia	claim
380	113	Co-ordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks	claim
381	113	Power Indices and minimal winning Coalitions	claim
382	113	Construction of Large Constant Dimension Codes With a Prescribed Minimum Distance	claim
383	113	A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions	claim
384	113	A Simple E-Voting Protocol	claim
385	113	Expressing OLAP operators with the TAX XML algebra	claim
386	113	Distributed Kalman Filter via Gaussian Belief Propagation	claim
387	113	Gaussian Belief Propagation Solver for Systems of Linear Equations	claim
388	113	Asymptotics of Entropy Rate in Special Families of Hidden Markov Chains	claim
389	113	Document stream clustering: experimenting an incremental algorithm and AR-based tools for highlighting dynamic trends	claim
390	113	Golden Space-Time Block Coded Modulation	claim
391	112	Investigating Artificial Immune Systems For Job Shop Rescheduling In Changing Environments	claim
392	112	Capacity of General Discrete Noiseless Channels	claim
393	112	Analytic aspects of the shuffle product	claim
394	112	Improved Squeaky Wheel Optimisation for Driver Scheduling	claim
395	112	Minimal weight expansions in Pisot bases	claim
396	112	SecMon: End-to-End Quality and Security Monitoring System	claim
397	112	Canonical calculi with (n,k)-ary quantifiers	claim
398	112	n-ary Fuzzy Logic and Neutrosophic Logic Operators	claim
399	112	The discrete Fourier transform: A canonical basis of eigenfunctions	claim
400	112	Approximating Transitivity in Directed Networks	claim
401	112	Target Localization Accuracy Gain in MIMO Radar Based Systems	claim
402	112	2D Linear Precoded OFDM for future mobile Digital Video Broadcasting	claim
403	112	Diversity-Multiplexing Tradeoff of the Half-Duplex Relay Channel	claim
404	112	The Fundamental Problem with the Building Block Hypothesis	claim
405	112	Distributed Estimation over Wireless Sensor Networks with Packet Losses	claim
406	112	Compact Labelings For Efficient First-Order Model-Checking	claim
407	112	How to eat 4/9 of a pizza	claim
408	112	Ni-MH battery modelling for ambient intelligence applications	claim
409	111	Fast Integer Multiplication using Modular Arithmetic	claim
410	111	A model for reactive porous transport during re-wetting of hardened concrete	claim
411	111	Computational Models of Spreadsheet Development: Basis for Educational Approaches	claim
412	111	On the Relation Between the Index Coding and the Network Coding Problems	claim
413	111	New Bounds for the Capacity Region of the Finite-State Multiple Access Channel	claim
414	111	On the decomposition of k-valued rational relations	claim
415	111	Risk Management for Complex Calculations: EuSpRIG Best Practices in Hybrid Applications	claim
416	111	Product theorems via semidefinite programming	claim
417	111	Fairness in Combinatorial Auctioning Systems	claim
418	111	Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings	claim
419	111	XML Rewriting Attacks: Existing Solutions and their Limitations	claim
420	111	New Sequences Design from Weil Representation with Low Two-Dimensional Correlation in Both Time and Phase Shifts	claim
421	111	Concave Programming Upper Bounds on the Capacity of 2-D Constraints	claim
422	111	3-Way Composition of Weighted Finite-State Transducers	claim
423	110	A Neyman-Pearson Approach to Universal Erasure and List Decoding	claim
424	110	Trimmed Moebius Inversion and Graphs of Bounded Degree	claim
425	110	Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem	claim
426	110	Correlated Anarchy in Overlapping Wireless Networks	claim
427	110	Audit and Change Analysis of Spreadsheets	claim
428	110	Rational streams coalgebraically	claim
429	110	Finding Dense Subgraphs in G(n,1/2)	claim
430	110	Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications	claim
431	110	Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs	claim
432	110	Justifications for Logic Programs under Answer Set Semantics	claim
433	110	The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments	claim
434	109	New Combinatorial Complete One-Way Functions	claim
435	109	Wavelet and Curvelet Moments for Image Classification: Application to Aggregate Mixture Grading	claim
436	109	Reconstruction of Multidimensional Signals from Irregular Noisy Samples	claim
437	109	Simulation of Coating -Visco-Elastic liquid in the Mico-Nip of Metering Size Press	claim
438	109	Malicious Bayesian Congestion Games	claim
439	109	Low-Complexity Structured Precoding for Spatially Correlated MIMO Channels	claim
440	109	A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding	claim
441	109	Compactly accessible categories and quantum key distribution	claim
442	109	Hybrid: A Definitional Two-Level Approach to Reasoning with Higher-Order Abstract Syntax	claim
443	109	Dependence Balance Based Outer Bounds for Gaussian Networks with Cooperation and Feedback	claim
444	109	Brain architecture: A design for natural computation	claim
445	109	EuSpRIG 2006 Commercial Spreadsheet Review	claim
446	109	LCSH, SKOS and Linked Data	claim
447	109	Characterising through Erasing: A Theoretical Framework for Representing Documents Inspired by Quantum Theory	claim
448	108	On Maximizing Coverage in Gaussian Relay Networks	claim
449	108	Tight Bounds for Blind Search on the Integers	claim
450	108	Heavy-Tailed Limits for Medium Size Jobs and Comparison Scheduling	claim
451	108	Defaults and Normality in Causal Structures	claim
452	108	On the Search for High-Rate Quasi-Orthogonal Space-Time Block Code	claim
453	108	Approximability and parameterized complexity of minmax values	claim
454	108	Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks	claim
455	108	Rate and power allocation under the pairwise distributed source coding constraint	claim
456	108	On Complexity of Minimum Leaf Out-branching Problem	claim
457	108	Hierarchical Bag of Paths for Kernel Based Shape Classification	claim
458	108	Query Refinement by Multi Word Term expansions and semantic synonymy	claim
459	108	Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning	claim
460	108	Linear Processing and Sum Throughput in the Multiuser MIMO Downlink	claim
461	108	Polyomino-Based Digital Halftoning	claim
462	108	Efficient Isomorphism Testing for a Class of Group Extensions	claim
463	107	Estimating Signals with Finite Rate of Innovation from Noisy Samples: A Stochastic Algorithm	claim
464	107	Ascending runs in dependent uniformly distributed random variables: Application to wireless networks	claim
465	107	On Termination for Faulty Channel Machines	claim
466	107	On Dynamic Breadth-First Search in External-Memory	claim
467	107	A Computational Framework for the Near Elimination of Spreadsheet Risk	claim
468	107	Symmetry Breaking for Maximum Satisfiability	claim
469	107	Power Series Composition and Change of Basis	claim
470	107	Optimization and AMS Modeling for Design of an Electrostatic Vibration Energy Harvester's Conditioning Circuit with an Auto-Adaptive Process to the External Vibration Changes	claim
471	107	Classification of Spreadsheet Errors	claim
472	107	The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification	claim
473	107	Metric Structures and Probabilistic Computation	claim
474	107	Randomized Methods for Linear Constraints: Convergence Rates and Conditioning	claim
475	107	The Degree Distribution of Random k-Trees	claim
476	107	Our Brothers' Keepers: Secure Routing with High Performance	claim
477	107	Model Checking Probabilistic Timed Automata with One or Two Clocks	claim
478	107	Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints	claim
479	107	Stiffness Analysis Of Multi-Chain Parallel Robotic Systems	claim
480	107	Modeling Spatial and Temporal Dependencies of User Mobility in Wireless Mobile Networks	claim
481	107	Semantics and Evaluation of Top-k Queries in Probabilistic Databases	claim
482	107	A Spectral Algorithm for Learning Hidden Markov Models	claim
483	107	The MIMO Iterative Waterfilling Algorithm	claim
484	107	Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections	claim
485	106	Spectral efficiency and optimal medium access control of random access systems over large random spreading CDMA	claim
486	106	Dempster-Shafer for Anomaly Detection	claim
487	106	Mapping Semantic Networks to Undirected Networks	claim
488	106	Infinity-Norm Sphere-Decoding	claim
489	106	Microfluidic Device for Continuous Magnetophoretic Separation of Red Blood Cells	claim
490	106	Quantization of Prior Probabilities for Hypothesis Testing	claim
491	106	Outer Bounds for Multiple Access Channels with Feedback using Dependence Balance	claim
492	106	Local approximation algorithms for a class of 0/1 max-min linear programs	claim
493	106	Human expert fusion for image classification	claim
494	106	Topological Observations on Multiplicative Additive Linear Logic	claim
495	106	GossiCrypt: Wireless Sensor Network Data Confidentiality Against Parasitic Adversaries	claim
496	106	Quantum walk based search algorithms	claim
497	106	Agent-based Ecological Model Calibration - on the Edge of a New Approach	claim
498	106	Multiprocessor Global Scheduling on Frame-Based DVFS Systems	claim
499	106	Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes	claim
500	106	Resource Allocation and Relay Selection for Collaborative Communications	claim
501	106	A variant of Wiener's attack on RSA	claim
502	106	Modular difference logic is hard	claim
503	106	Resource Allocation for Downlink Cellular OFDMA Systems: Part I - Optimal Allocation	claim
504	106	Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links	claim
505	106	Fast Maximum-Likelihood Decoding of the Golden Code	claim
506	105	Certifying floating-point implementations using Gappa	claim
507	105	Interior-Point Algorithms for Linear-Programming Decoding	claim
508	105	2-D Analysis of Enhancement of Analytes Adsorption Due to Flow Stirring by Electrothermal Force in The Microcantilever Sensor	claim
509	105	A compact topology for sand automata	claim
510	105	Simulation Optimization of the Crossdock Door Assignment Problem	claim
511	105	Robust Machine Learning Applied to Terascale Astronomical Datasets	claim
512	105	On Full Diversity Space-Time Block Codes with Partial Interference Cancellation Group Decoding	claim
513	105	Design Patterns for Complex Event Processing	claim
514	105	Success Exponent of Wiretapper: A Tradeoff between Secrecy and Reliability	claim
515	105	A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations	claim
516	105	Integrating OPC Data into GSN Infrastructures	claim
517	105	SOSEMANUK: a fast software-oriented stream cipher	claim
518	105	Heterogeneous component interactions: Sensors integration into multimedia applications	claim
519	105	Covert Channels in SIP for VoIP signalling	claim
520	104	A General Notion of Useful Information	claim
521	104	Policies of System Level Pipeline Modeling	claim
522	104	A Pyramidal Evolutionary Algorithm with Different Inter-Agent Partnering Strategies for Scheduling Problems	claim
523	104	Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems	claim
524	104	The Case for Structured Random Codes in Network Capacity Theorems	claim
525	104	Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic	claim
526	104	Some Aspects of Testing Process for Transport Streams in Digital Video Broadcasting	claim
527	104	New bounds on classical and quantum one-way communication complexity	claim
528	104	Femtocell Networks: A Survey	claim
529	104	A Recommender System based on Idiotypic Artificial Immune Networks	claim
530	104	A General Framework for Sound and Complete Floyd-Hoare Logics	claim
531	104	A Variational Inference Framework for Soft-In-Soft-Out Detection in Multiple Access Channels	claim
532	104	Improving Local Search for Fuzzy Scheduling Problems	claim
533	104	Structural abstract interpretation, A formal study using Coq	claim
534	104	Graphical Presentations of Symmetric Monoidal Closed Theories	claim
535	104	Coalgebraic Automata Theory: Basic Results	claim
536	104	Interoperability between Heterogeneous Federation Architectures: Illustration with SAML and WS-Federation	claim
537	104	Stable normal forms for polynomial system solving	claim
538	104	Secrecy capacity of a class of orthogonal relay eavesdropper channels	claim
539	104	De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences	claim
540	104	Interface Matching and Combining Techniques for Services Integration	claim
541	103	Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime	claim
542	103	On the Effects of Idiotypic Interactions for Recommendation Communities in Artificial Immune Systems	claim
543	103	Path Loss Exponent Estimation in Large Wireless Networks	claim
544	103	A Theory for Valiant's Matchcircuits (Extended Abstract)	claim
545	103	Characterisation of an Electrostatic Vibration Harvester	claim
546	103	The Capacity Region of the Degraded Finite-State Broadcast Channel	claim
547	103	Single Chip Sensing of Multiple Gas Flows	claim
548	103	Flatness of the Energy Landscape for Horn Clauses	claim
549	103	Game Refinement Relations and Metrics	claim
550	103	When, why and how to test spreadsheets	claim
551	103	An outer bound for 2-receiver discrete memoryless broadcast channels	claim
552	103	Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs	claim
553	103	Executable Set Theory and Arithmetic Encodings in Prolog	claim
554	103	Mode Change Protocol for Multi-Mode Real-Time Systems upon Identical Multiprocessors	claim
555	103	Packing multiway cuts in capacitated graphs	claim
556	103	"Real" Slepian-Wolf Codes	claim
557	103	A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels	claim
558	103	Generating Random Graphs with Large Girth	claim
559	103	Secret Communication with Feedback	claim
560	103	Quickest Change Detection of a Markov Process Across a Sensor Array	claim
561	103	Using descriptive mark-up to formalize translation quality assessment	claim
562	102	A High-Q Microwave MEMS Resonator	claim
563	102	Architecture for Integrated Mems Resonators Quality Factor Measurement	claim
564	102	Breaking Out of the Cell: On The Benefits of a New Spreadsheet User-Interaction Paradigm	claim
565	102	SAFIUS - A secure and accountable filesystem over untrusted storage	claim
566	102	(Mechanical) Reasoning on Infinite Extensive Games	claim
567	102	How Is Meaning Grounded in Dictionary Definitions?	claim
568	102	On some deterministic dictionaries supporting sparsity	claim
569	102	Offloading Cognition onto Cognitive Technology	claim
570	102	Finding cores of random 2-SAT formulae via Poisson cloning	claim
571	102	Game Theory with Costly Computation	claim
572	102	An MAS-Based ETL Approach for Complex Data	claim
573	102	SWIM: A Simple Model to Generate Small Mobile Worlds	claim
574	102	Spreadsheet modelling for solving combinatorial problems: The vendor selection problem	claim
575	102	Moore and more and symmetry	claim
576	101	An Approach to Programming Based on Concepts	claim
577	101	Cognitive networks achieve throughput scaling of a homogeneous network	claim
578	101	Choice numbers of graphs	claim
579	101	Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound	claim
580	101	Unequal Error Protection: Some Fundamental Limits	claim
581	101	Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games	claim
582	101	Concept-Oriented Programming	claim
583	101	Belief decision support and reject for textured images characterization	claim
584	101	One useful logic that defines its own truth	claim
585	100	Merkle Puzzles are Optimal	claim
586	100	Graph-Based Classification of Self-Dual Additive Codes over Finite Fields	claim
587	100	An Agent-Based Simulation of In-Store Customer Experiences	claim
588	100	Comparison of the Discriminatory Processor Sharing Policies	claim
589	100	Spatial Interference Cancelation for Mobile Ad Hoc Networks: Perfect CSI	claim
590	100	Wadge Degrees of Infinitary Rational Relations	claim
591	100	Lossy Source Transmission over the Relay Channel	claim
592	100	Statistical region-based active contours with exponential family observations	claim
593	100	Myopic Coding in Multiterminal Networks	claim
594	100	MIML: A Framework for Learning with Ambiguous Objects	claim
595	100	A functional view of upper bounds on codes	claim
596	100	Learning Isometric Separation Maps	claim
597	100	Edhibou: a Customizable Interface for Decision Support in a Semantic Portal	claim
598	100	Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs	claim
599	100	A note on regular Ramsey graphs	claim
600	99	Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm	claim
601	99	A Model-Based Frequency Constraint for Mining Associations from Transaction Data	claim
602	99	Decomposing replicable functions	claim
603	99	Constructions for Clumps Statistics	claim
604	99	Stabbing simplices by points and flats	claim
605	99	An Ontology-based Knowledge Management System for Industry Clusters	claim
606	99	Collaborative model of interaction and Unmanned Vehicle Systems' interface	claim
607	99	When is there a representer theorem? Vector versus matrix regularizers	claim
608	99	Modelling interdependencies between the electricity and information infrastructures	claim
609	99	The meaning of concurrent programs	claim
610	99	Exponential-Time Approximation of Hard Problems	claim
611	99	Omnidirectional Relay in Wireless Networks	claim
612	99	Perturbation analysis of an M/M/1 queue in a diffusion random environment	claim
613	99	A New Trend in Optimization on Multi Overcomplete Dictionary toward Inpainting	claim
614	99	An Energy-Based Comparison of Long-Hop and Short-Hop Routing in MIMO Networks	claim
615	99	On the reconstruction of block-sparse signals with an optimal number of measurements	claim
616	99	Extension of Inagaki General Weighted Operators and A New Fusion Rule Class of Proportional Redistribution of Intersection Masses	claim
617	98	Does intelligence imply contradiction?	claim
618	98	The Physical World as a Virtual Reality	claim
619	98	Ideal synchronizer for marked pairs in fork-join network	claim
620	98	Picking up the Pieces: Self-Healing in Reconfigurable Networks	claim
621	98	Spanners of Additively Weighted Point Sets	claim
622	98	Modeling of T-Shaped Microcantilever Resonators	claim
623	98	Local Information Based Algorithms for Packet Transport in Complex Networks	claim
624	98	Void Traversal for Guaranteed Delivery in Geometric Routing	claim
625	98	Bayesian Optimisation Algorithm for Nurse Scheduling	claim
626	98	Information Acquisition and Exploitation in Multichannel Wireless Networks	claim
627	98	On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels	claim
628	98	The Gaussian MAC with Conferencing Encoders	claim
629	98	An Information-Theoretical View of Network-Aware Malware Attacks	claim
630	98	Design and Analysis of a Chaotic Micromixer with Vortices Modulation	claim
631	98	An Experimental Investigation of XML Compression Tools	claim
632	98	Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices	claim
633	98	Logics for the Relational Syllogistic	claim
634	98	Sparse Recovery by Non-convex Optimization -- Instance Optimality	claim
635	98	High-SNR Analysis of Outage-Limited Communications with Bursty and Delay-Limited Information	claim
636	98	An Asymptotically Optimal RFID Authentication Protocol Against Relay Attacks	claim
637	98	Divisibility, Smoothness and Cryptographic Applications	claim
638	98	Secrecy in Cooperative Relay Broadcast Channels	claim
639	98	Wide spread spectrum watermarking with side information and interference cancellation	claim
640	98	Sign Language Tutoring Tool	claim
641	98	On Outage and Error Rate Analysis of the Ordered V-BLAST	claim
642	97	Lower bounds for adaptive linearity tests	claim
643	97	Voice-controlled Debugging of Spreadsheets	claim
644	97	Directive words of episturmian words: equivalences and normalization	claim
645	97	Towards a Spreadsheet Engineering	claim
646	97	Spreading Signals in the Wideband Limit	claim
647	97	Fast Density Codes for Image Data	claim
648	97	Power-Balanced Orthogonal Space-Time Block Code	claim
649	97	Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents	claim
650	97	Self-Motions of General 3-RPR Planar Parallel Robots	claim
651	97	An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience	claim
652	97	Gaussian Belief Propagation Based Multiuser Detection	claim
653	97	Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures	claim
654	97	The Church Problem for Countable Ordinals	claim
655	97	Modeling Cultural Dynamics	claim
656	96	Popularity, Novelty and Attention	claim
657	96	New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures	claim
658	96	On Directed Information and Gambling	claim
659	96	Improved Approximations for Multiprocessor Scheduling Under Uncertainty	claim
660	96	High Efficiency 3-Phase Cmos Rectifier with Step Up and Regulated	claim
661	96	Linear programming bounds for unitary space time codes	claim
662	96	Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas	claim
663	96	Communication Lower Bounds Using Dual Polynomials	claim
664	96	Public Discourse in the Web Does Not Exhibit Group Polarization	claim
665	96	On the Superdistribution of Digital Goods	claim
666	96	Cardinality heterogeneities in Web service composition: Issues and solutions	claim
667	96	Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints	claim
668	96	Performance Modeling and Evaluation for Information-Driven Networks	claim
669	96	A Sparse Flat Extension Theorem for Moment Matrices	claim
670	96	Tree-width of hypergraphs and surface duality	claim
671	95	Towards a formalization of budgets	claim
672	95	Simulation of Free Surface Compressible Flows Via a Two Fluid Model	claim
673	95	An Indirect Genetic Algorithm for a Nurse Scheduling Problem	claim
674	95	Asymptotics of Input-Constrained Binary Symmetric Channel Capacity	claim
675	95	Explicit Learning: an Effort towards Human Scheduling Algorithms	claim
676	95	Some properties of the regular asynchronous systems	claim
677	95	On-Chip Hotplate for Temperature Control of Cmos Saw Resonators	claim
678	95	A Simple Algebraic Formulation for the Scalar Linear Network Coding Problem	claim
679	95	Depth as Randomness Deficiency	claim
680	95	The Plane-Width of Graphs	claim
681	94	Small Turing universal signal machines	claim
682	94	On the Weight Distribution of the Extended Quadratic Residue Code of Prime 137	claim
683	94	On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels	claim
684	94	A Toolkit for Scalable Spreadsheet Visualization	claim
685	94	Stateless and Delivery Guaranteed Geometric Routing on Virtual Coordinate System	claim
686	94	Joint Beamforming for Multiaccess MIMO Systems with Finite Rate Feedback	claim
687	94	Through Silicon Vias as Enablers for 3D Systems	claim
688	94	Decision Support with Belief Functions Theory for Seabed Characterization	claim
689	94	Robust Joint Source-Channel Coding for Delay-Limited Applications	claim
690	94	Complexity of Hybrid Logics over Transitive Frames	claim
691	94	Minimum Dissatisfaction Personnel Scheduling	claim
692	94	Enhanced Integrated Scoring for Cleaning Dirty Texts	claim
693	94	Error Exponents of Optimum Decoding for the Interference Channel	claim
694	94	Persistent Queries	claim
695	94	Performance of Hybrid-ARQ in Block-Fading Channels: A Fixed Outage Probability Analysis	claim
696	94	The statistical restricted isometry property and the Wigner semicircle distribution of incoherent dictionaries	claim
697	94	Semi-continuous Sized Types and Termination	claim
698	93	Asynchronous Iterative Waterfilling for Gaussian Frequency-Selective Interference Channels	claim
699	93	Structural aspects of tilings	claim
700	93	Succinctness of the Complement and Intersection of Regular Expressions	claim
701	93	Visibly Tree Automata with Memory and Constraints	claim
702	93	An optimization problem on the sphere	claim
703	93	The end of Sleeping Beauty's nightmare	claim
704	93	On Field Size and Success Probability in Network Coding	claim
705	93	Resource Allocation Strategies for In-Network Stream Processing	claim
706	93	Transitive-Closure Spanners	claim
707	93	A computer verified, monadic, functional implementation of the integral	claim
708	93	On Fan Raspaud Conjecture	claim
709	93	Design And Fabrication of Condenser Microphone Using Wafer Transfer And Micro-electroplating Technique	claim
710	92	On sign conditions over real multivariate polynomials	claim
711	92	Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps	claim
712	92	Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees	claim
713	92	A connection between palindromic and factor complexity using return words	claim
714	92	Automated Termination Proofs for Logic Programs by Term Rewriting	claim
715	92	Universal Quantum Circuits	claim
716	92	Nonnegative Matrix Factorization via Rank-One Downdate	claim
717	92	L2 Orthogonal Space Time Code for Continuous Phase Modulation	claim
718	92	Differential Transmit Diversity Based on Quasi-Orthogonal Space-Time Block Code	claim
719	92	Catching Up Faster by Switching Sooner: A Prequential Solution to the AIC-BIC Dilemma	claim
720	92	Accelerating Large-scale Data Exploration through Data Diffusion	claim
721	92	Entropy of Hidden Markov Processes via Cycle Expansion	claim
722	92	Convex Sparse Matrix Factorizations	claim
723	92	Branching Bisimilarity with Explicit Divergence	claim
724	92	Central Limit Theorems for Wavelet Packet Decompositions of Stationary Random Processes	claim
725	92	Interconnect Challenges in Highly Integrated MEMS/ASIC Subsystems	claim
726	92	Bridge configurations in piezoresistive two-axis accelerometers	claim
727	92	Bipolarization of posets and natural interpolation	claim
728	92	Source Coding for a Simple Network with Receiver Side Information	claim
729	91	Exchange of Limits: Why Iterative Decoding Works	claim
730	91	Digraph Decompositions and Monotonicity in Digraph Searching	claim
731	91	Secure Lossless Compression with Side Information	claim
732	91	Outage behavior of slow fading channels with power control using noisy quantized CSIT	claim
733	91	The quest for rings on bipolar scales	claim
734	91	Measure and integral with purely ordinal scales	claim
735	91	Natural pseudo-distance and optimal matching between reduced size functions	claim
736	91	Particle Filtering for Large Dimensional State Spaces with Multimodal Observation Likelihoods	claim
737	91	High Density out-of-Plane Microprobe Array	claim
738	91	Significant Diagnostic Counterexamples in Probabilistic Model Checking	claim
739	91	The Mixing Time of Glauber Dynamics for Colouring Regular Trees	claim
740	91	An Algebraic Approach for the MIMO Control of Small Scale Helicopter	claim
741	91	Music, Complexity, Information	claim
742	91	A Logical Model and Data Placement Strategies for MEMS Storage Devices	claim
743	91	Randomised Variable Neighbourhood Search for Multi Objective Optimisation	claim
744	91	A Distributed MAC Protocol for Cooperation in Random Access Networks	claim
745	91	Taming Modal Impredicativity: Superlazy Reduction	claim
746	91	Algorithmic and Statistical Challenges in Modern Large-Scale Data Analysis are the Focus of MMDS 2008	claim
747	90	Silicon on Nothing Mems Electromechanical Resonator	claim
748	90	Dynamic data models: an application of MOP-based persistence in Common Lisp	claim
749	90	A Queueing System for Modeling a File Sharing Principle	claim
750	90	An Indirect Genetic Algorithm for Set Covering Problems	claim
751	90	Cauchy's Arm Lemma on a Growing Sphere	claim
752	90	Spacetime Meshing for Discontinuous Galerkin Methods	claim
753	90	A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem	claim
754	90	Dynamic Connectivity in ALOHA Ad Hoc Networks	claim
755	90	Communication-Efficient Construction of the Plane Localized Delaunay Graph	claim
756	90	A New Upper Bound on the Capacity of a Class of Primitive Relay Channels	claim
757	90	On characterising strong bisimilarity in a fragment of CCS with replication	claim
758	90	A computationally-efficient construction for the matrix-based key distribution in sensor network	claim
759	90	Effective Complexity and its Relation to Logical Depth	claim
760	89	A New Approach to Spreadsheet Analytics Management in Financial Markets	claim
761	89	One MEMS Design Tool with Maximal Six Design Flows	claim
762	89	Idiotypic Immune Networks in Mobile Robot Control	claim
763	89	A Distance Metric for Tree-Sibling Time Consistent Phylogenetic Networks	claim
764	89	Information Theoretic Operating Regimes of Large Wireless Networks	claim
765	89	On Endogenous Reconfiguration in Mobile Robotic Networks	claim
766	89	Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three	claim
767	89	Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations	claim
768	89	Recursive Concurrent Stochastic Games	claim
769	89	Disjunctive Databases for Representing Repairs	claim
770	88	Coding Strategies for Noise-free Relay Cascades with Half-Duplex Constraint	claim
771	88	ARQ for Network Coding	claim
772	88	Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages	claim
773	88	Online Sensor Testing through Superposition of Encoded Stimulus	claim
774	88	RubberEdge: Reducing Clutching by Combining Position and Rate Control with Elastic Feedback	claim
775	88	Unitary Differential Space-Time Modulation with Joint Modulation	claim
776	88	On (Omega-)Regular Model Checking	claim
777	88	Framework for Dynamic Evaluation of Muscle Fatigue in Manual Handling Work	claim
778	88	Lower bounds for distributed markov chain problems	claim
779	88	The Korrontea Data Modeling	claim
780	88	Diversity-Multiplexing Tradeoff for the MIMO Static Half-Duplex Relay	claim
781	88	Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations	claim
782	87	Two-Level Concept-Oriented Data Model	claim
783	87	Comparison of Spreadsheets with other Development Tools (limitations, solutions, workarounds and alternatives)	claim
784	87	Identification of Test Structures for Reduced Order Modeling of the Squeeze Film Damping in Mems	claim
785	87	Towards an Optimal Separation of Space and Length in Resolution	claim
786	87	The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel	claim
787	87	A multivariate generalization of Costa's entropy power inequality	claim
788	87	High Q-factor CMOS-MEMS inductor	claim
789	87	The pre-log of Gaussian broadcast with feedback can be two	claim
790	87	Green Codes: Energy-Efficient Short-Range Communication	claim
791	87	Experts Fusion and Multilayer Perceptron Based on Belief Learning for Sonar Image Classification	claim
792	87	Building a terminology network for search: the KoMoHe project	claim
793	87	Planar Visibility Counting	claim
794	87	Visualization of association graphs for assisting the interpretation of classifications	claim
795	87	Indoor Channel Measurements and Communications System Design at 60 GHz	claim
796	87	An Integrated Circuit Compatible Compact Package for Thermal Gas Flowmeters	claim
797	87	Portable Valve-less Peristaltic Micro-pump Design and Fabrication	claim
798	86	Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set	claim
799	86	Twenty-Five Moves Suffice for Rubik's Cube	claim
800	86	Megasonic Enhanced Electrodeposition	claim
801	86	A Microcantilever-based Gas Flow Sensor for Flow Rate and Direction Detection	claim
802	86	Noise Analysis and Noise-based Optimization for Resonant MEMS Structures	claim
803	86	Design and Fabrication of a Novel Micro Electromagnetic Actuator	claim
804	86	Fast computation of the median by successive binning	claim
805	86	Polygon Exploration with Discrete Vision	claim
806	86	A new characteristic property of rich words	claim
807	86	Capacity Regions and Bounds for a Class of Z-interference Channels	claim
808	86	The Ratio Index for Budgeted Learning, with Applications	claim
809	86	The Connectivity of NK Landscapes' Basins: A Network Analysis	claim
810	86	Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems	claim
811	86	Fibonacci Index and Stability Number of Graphs: a Polyhedral Study	claim
812	86	Dynamic System Adaptation by Constraint Orchestration	claim
813	85	New Estimation Procedures for PLS Path Modelling	claim
814	85	Self-* overload control for distributed web systems	claim
815	85	Minimizing Flow Time in the Wireless Gathering Problem	claim
816	85	Introduction to Multi-Agent Simulation	claim
817	85	Discrete Mathematics for Computer Science, Some Notes	claim
818	85	Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections	claim
819	85	Online Scheduling to Minimize the Maximum Delay Factor	claim
820	85	Quantifying Timing Leaks and Cost Optimisation	claim
821	85	Ranking and Unranking of Hereditarily Finite Functions and Permutations	claim
822	85	Occupancy distributions of homogeneous queueing systems under opportunistic scheduling	claim
823	85	Optimal Transmission Strategy and Explicit Capacity Region for Broadcast Z Channels	claim
824	85	Finite Lattice-Size Effects in MIMO Detection	claim
825	85	Feature Markov Decision Processes	claim
826	84	On the Period of a Periodic-Finite-Type Shift	claim
827	84	The emerging field of language dynamics	claim
828	84	Small Is Not Always Beautiful	claim
829	84	A Recommender System based on the Immune Network	claim
830	84	Words and morphisms with Sturmian erasures	claim
831	84	Message-Passing Decoding of Lattices Using Gaussian Mixtures	claim
832	84	A Paradigm for Spreadsheet Engineering Methodologies	claim
833	84	Efficiently Testing Sparse GF(2) Polynomials	claim
834	84	Path Diversity over Packet Switched Networks: Performance Analysis and Rate Allocation	claim
835	84	Nested Ordered Sets and their Use for Data Modelling	claim
836	84	TuLiPA: Towards a Multi-Formalism Parsing Environment for Grammar Engineering	claim
837	84	On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes	claim
838	84	On the Index Coding Problem and its Relation to Network Coding and Matroid Theory	claim
839	84	Rate and Power Allocation in Fading Multiple Access Channels	claim
840	84	The Latent Relation Mapping Engine: Algorithm and Experiments	claim
841	84	Nanobiosensors based on individual olfactory receptors	claim
842	84	Novel Bonding technologies for wafer-level transparent packaging of MOEMS	claim
843	84	Coupling Component Systems towards Systems of Systems	claim
844	83	Concepts and their Use for Modelling Objects and References in Programming Languages	claim
845	83	Alternating Hierarchies for Time-Space Tradeoffs	claim
846	83	Service Oriented Architecture in Network Security - a novel Organisation in Security Systems	claim
847	83	In-Plane Bistable Nanowire For Memory Devices	claim
848	83	Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability	claim
849	83	Computing the nucleolus of weighted voting games	claim
850	83	Code diversity in multiple antenna wireless communication	claim
851	83	Navigating ultra-small worlds in ultra-short time	claim
852	83	Resource Allocation in Multiple Access Channels	claim
853	83	Modeling of a piezoelectric micro-scanner	claim
854	83	Distributed Space Time Codes for the Amplify-and-Forward Multiple-Access Relay Channel	claim
855	83	Diversity Order Gain with Noisy Feedback in Multiple Access Channels	claim
856	82	An Evaluation of a Structured Spreadsheet Development Methodology	claim
857	82	Adaptive Dynamics of Realistic Small-World Networks	claim
858	82	Algorithms for Game Metrics (Full Version)	claim
859	82	On the Throughput Maximization in Dencentralized Wireless Networks	claim
860	82	Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation	claim
861	81	Capacity Bounds for Peak-Constrained Multiantenna Wideband Channels	claim
862	81	Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem	claim
863	81	Proactive Service Migration for Long-Running Byzantine Fault Tolerant Systems	claim
864	81	Rule Generalisation in Intrusion Detection Systems using Snort	claim
865	81	Fabrication of Nanostructured PLGA Scaffolds Using Anodic Aluminum Oxide Templates	claim
866	81	Low-Drift Flow Sensor with Zero-Offset Thermopile-Based Power Feedback	claim
867	81	Platform-Independent Firewall Policy Representation	claim
868	81	A New Type of Cipher: DICING_csb	claim
869	81	High-dimensional subset recovery in noise: Sparsified measurements without loss of statistical efficiency	claim
870	81	Kinematic Analysis of the vertebra of an eel like robot	claim
871	81	Unveiling the mystery of visual information processing in human brain	claim
872	81	Universal Denoising of Discrete-time Continuous-Amplitude Signals	claim
873	81	The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite	claim
874	81	The Golden Ratio Encoder	claim
875	81	Relay vs. User Cooperation in Time-Duplexed Multiaccess Networks	claim
876	81	Complexity Classes as Mathematical Axioms	claim
877	81	Camera distortion self-calibration using the plumb-line constraint and minimal Hough entropy	claim
878	81	Effect of Tuned Parameters on a LSA MCQ Answering Model	claim
879	81	Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions	claim
880	81	Revisiting the Core Ontology and Problem in Requirements Engineering	claim
881	80	Reserved-Length Prefix Coding	claim
882	80	Joint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation	claim
883	80	Model for synchronizer of marked pairs in fork-join network	claim
884	80	Multi-Layer Perceptrons and Symbolic Data	claim
885	80	Optimization of Cricket-inspired, Biomimetic Artificial Hair Sensors for Flow Sensing	claim
886	80	A Dual Polynomial for OR	claim
887	80	Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version)	claim
888	80	Complexity and algorithms for computing Voronoi cells of lattices	claim
889	80	The Transport Capacity of a Wireless Network is a Subadditive Euclidean Functional	claim
890	80	Low-Complexity Coding and Source-Optimized Clustering for Large-Scale Sensor Networks	claim
891	80	Channel and Multiuser Diversities in Wireless Systems: Delay-Energy Tradeoff	claim
892	80	Urologic robots and future directions	claim
893	79	Indirect Object Representation and Access by Means of Concepts	claim
894	79	A System Theoretic Approach to Bandwidth Estimation	claim
895	79	New Outer Bounds on the Capacity Region of Gaussian Interference Channels	claim
896	79	A Simple Distributed Antenna Processing Scheme for Cooperative Diversity	claim
897	79	Set-up and characterization of a humidity sensor realized in LTCC-technology	claim
898	79	Generic case complexity and One-Way functions	claim
899	79	A Note on Differential Privacy: Defining Resistance to Arbitrary Side Information	claim
900	79	The shortest game of Chinese Checkers and related problems	claim
901	79	Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes	claim
902	79	WiPal: Efficient Offline Merging of IEEE 802.11 Traces	claim
903	79	Logics for XML	claim
904	79	Non-classical Role of Potential Energy in Adiabatic Quantum Annealing	claim
905	79	Random Projections for the Nonnegative Least-Squares Problem	claim
906	78	3D/4D ultrasound registration of bone	claim
907	78	On the Continuity Set of an omega Rational Function	claim
908	78	Set theoretical Representations of Integers, I	claim
909	78	Philosophical Smoke Signals: Theory and Practice in Information Systems Design	claim
910	78	Spread Codes and Spread Decoding in Network Coding	claim
911	78	Dynamic Network of Concepts from Web-Publications	claim
912	78	Distributed Beamforming with Feedback: Convergence Analysis	claim
913	78	On Computing the Vertex Centroid of a Polyhedron	claim
914	78	Verified Null-Move Pruning	claim
915	78	Report on the "Secure Vehicular Communications: Results and Challenges Ahead" Workshop	claim
916	78	An Efficient Algorithm for Cooperative Spectrum Sensing in Cognitive Radio Networks	claim
917	78	A linear time algorithm for L(2,1)-labeling of trees	claim
918	78	Classification dynamique d'un flux documentaire : une évaluation statique préalable de l'algorithme GERMEN	claim
919	78	Characterizing Truthful Multi-Armed Bandit Mechanisms	claim
920	78	A Two-Step Etching Method to Fabricate Nanopores in Silicon	claim
921	78	Wireless Secrecy in Cellular Systems with Infrastructure--Aided Cooperation	claim
922	77	Programming an interpreter using molecular dynamics	claim
923	77	Zero-knowledge authentication schemes from actions on graphs, groups, or rings	claim
924	77	A Reconfigurable Impedance Matching Network Employing RF-MEMS Switches	claim
925	77	Open Ended Microwave Oven for Packaging	claim
926	77	The Separation of Duty with Privilege Calculus	claim
927	77	Data-Oblivious Stream Productivity	claim
928	77	Optimal hash functions for approximate closest pairs on the n-cube	claim
929	77	Energy-efficient Scheduling of Delay Constrained Traffic over Fading Channels	claim
930	77	The Peculiar Phase Structure of Random Graph Bisection	claim
931	77	Principal Graphs and Manifolds	claim
932	77	Crowdsourcing, Attention and Productivity	claim
933	77	Sorting by Placement and Shift	claim
934	77	Interpolation of Shifted-Lacunary Polynomials	claim
935	76	Complexity of Combinatorial Market Makers	claim
936	76	Limit complexities revisited	claim
937	76	Trimming of Graphs, with Application to Point Labeling	claim
938	76	Fabrication of MEMS Resonators in Thin SOI	claim
939	76	Copper Planar Microcoils Applied to Magnetic Actuation	claim
940	76	Design and Fabrication of the Suspended High-Q Spiral Inductors with X-Beams	claim
941	76	Facing the Facts	claim
942	76	Fast unfolding of community hierarchies in large networks	claim
943	76	Communication Requirements for Generating Correlated Random Variables	claim
944	76	Alternating Automata on Data Trees and XPath Satisfiability	claim
945	76	Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs	claim
946	76	Succinct Geometric Indexes Supporting Point Location Queries	claim
947	76	Communication-avoiding parallel and sequential QR factorizations	claim
948	76	On Information Rates of the Fading Wyner Cellular Model via the Thouless Formula for the Strip	claim
949	76	An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities	claim
950	76	Communication Through Jamming over a Slotted ALOHA Channel	claim
951	76	Foundations of Information Theory	claim
952	76	Interaction Grammars	claim
953	76	Termination Criteria for Solving Concurrent Safety and Reachability Games	claim
954	76	Collaborative process control: Observation of tracks generated by PLM system	claim
955	76	The Good, the Bad, and the Ugly: three different approaches to break their watermarking system	claim
956	76	Measurement of Large Forces and Deflections in Microstructures	claim
957	75	Impact of Errors in Operational Spreadsheets	claim
958	75	Stackelberg Network Pricing Games	claim
959	75	Step-up converter for electromagnetic vibrational energy scavenger	claim
960	75	Conditioning Probabilistic Databases	claim
961	75	On the Sum-Capacity of Degraded Gaussian Multiaccess Relay Channels	claim
962	75	Equivalent characterizations of partial randomness for a recursively enumerable real	claim
963	75	On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs	claim
964	75	Inductive and Coinductive Components of Corecursive Functions in Coq	claim
965	75	A new probabilistic transformation of belief mass assignment	claim
966	75	Capacity of a Class of Diamond Channels	claim
967	75	Soft-Input Soft-Output Sphere Decoding	claim
968	74	Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs	claim
969	74	Analysis of the Karmarkar-Karp Differencing Algorithm	claim
970	74	On mobile sets in the binary hypercube	claim
971	74	On Certain Large Random Hermitian Jacobi Matrices with Applications to Wireless Communications	claim
972	74	Biased Range Trees	claim
973	74	Understanding individual human mobility patterns	claim
974	74	On the random satisfiable process	claim
975	74	Solving package dependencies: from EDOS to Mancoosi	claim
976	74	Highly Undecidable Problems about Recognizability by Tiling Systems	claim
977	73	On acceptance conditions for membrane systems: characterisations of L and NL	claim
978	73	Sum Capacity of the Gaussian Interference Channel in the Low Interference Regime	claim
979	73	Permeability Analysis based on information granulation theory	claim
980	73	Causal inference using the algorithmic Markov condition	claim
981	73	RF-MEMS Switched Varactors for Medium Power Applications	claim
982	73	Twice-Ramanujan Sparsifiers	claim
983	73	Classical Knowledge for Quantum Security	claim
984	73	A Spectrum-Shaping Perspective on Cognitive Radio	claim
985	73	On Information-Theoretic Scaling Laws for Wireless Networks	claim
986	73	Weyl's Predicative Classical Mathematics as a Logic-Enriched Type Theory	claim
987	73	Regularities of the distribution of abstract van der Corput sequences	claim
988	73	Energy Benefit of Network Coding for Multiple Unicast in Wireless Networks	claim
989	73	Web Usage Analysis: New Science Indicators and Co-usage	claim
990	73	Homomorphism Preservation on Quasi-Wide Classes	claim
991	73	Secrecy Capacity of a Class of Broadcast Channels with an Eavesdropper	claim
992	73	Stiffness Analysis of 3-d.o.f. Overconstrained Translational Parallel Manipulators	claim
993	72	Longest paths in Planar DAGs in Unambiguous Logspace	claim
994	72	From MEMS Devices to Smart Integrated Systems	claim
995	72	Design Optimization for an Electro-Thermally Actuated Polymeric Microgripper	claim
996	72	Lossless Compression with Security Constraints	claim
997	72	Channels that Heat Up	claim
998	72	Statistical Learning of Arbitrary Computable Classifiers	claim
999	72	Single source shortest paths in H-minor free graphs	claim
1000	72	Inferring Company Structure from Limited Available Information	claim
1001	71	Distributed Double Spending Prevention	claim
1002	71	Generalized Whac-a-Mole	claim
1003	71	Problem Solving and Complex Systems	claim
1004	71	A Survey of Quantum Programming Languages: History, Methods, and Tools	claim
1005	71	Secret Key Agreement by Soft-decision of Signals in Gaussian Maurer's Model	claim
1006	71	Subclose Families, Threshold Graphs, and the Weight Hierarchy of Grassmann and Schubert Codes	claim
1007	71	On the Secure Degrees of Freedom of Wireless X Networks	claim
1008	71	Asteroids in rooted and directed path graphs	claim
1009	71	On Successive Refinement for the Kaspi/Heegard-Berger Problem	claim
1010	70	Enterprise Spreadsheet Management: A Necessary Good	claim
1011	70	Silicon microneedles array with biodegradable tips for transdermal drug delivery	claim
1012	70	Random Vandermonde Matrices-Part II: Applications	claim
1013	70	Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes	claim
1014	70	Every Computably Enumerable Random Real Is Provably Computably Enumerable Random	claim
1015	70	A Refined Difference Field Theory for Symbolic Summation	claim
1016	70	On Granular Knowledge Structures	claim
1017	70	Necessary Conditions for Discontinuities of Multidimensional Size Functions	claim
1018	70	On the Expressive Power of 2-Stack Visibly Pushdown Automata	claim
1019	70	Feature Dynamic Bayesian Networks	claim
1020	69	Compressed Counting	claim
1021	69	Safety alternating automata on data words	claim
1022	69	Characterizing path graphs by forbidden induced subgraphs	claim
1023	69	TellTable Spreadsheet Audit: from Technical Possibility to Operating Prototype	claim
1024	69	Hash Property and Fixed-rate Universal Coding Theorems	claim
1025	69	Solving Time of Least Square Systems in Sigma-Pi Unit Networks	claim
1026	69	The Gaussian Many-Help-One Distributed Source Coding Problem	claim
1027	69	On the entropy and log-concavity of compound Poisson measures	claim
1028	69	L2 OSTC-CPM: Theory and design	claim
1029	69	Information In The Non-Stationary Case	claim
1030	69	Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity	claim
1031	69	Improved Algorithms for Approximate String Matching (Extended Abstract)	claim
1032	69	Relative Entropy and Statistics	claim
1033	69	Phase transition for Local Search on planted SAT	claim
1034	69	Sensitivity Analysis Using a Fixed Point Interval Iteration	claim
1035	69	Two Models for Noisy Feedback in MIMO Channels	claim
1036	68	Improved lower bound for deterministic broadcasting in radio networks	claim
1037	68	Support Vector classifiers for Land Cover Classification	claim
1038	68	Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental	claim
1039	68	Sum-Capacity of Ergodic Fading Interference and Compound Multiaccess Channels	claim
1040	68	Three-dimensional Random Voronoi Tessellations: From Cubic Crystal Lattices to Poisson Point Processes	claim
1041	68	Capacity of Block-Memoryless Channels with Causal Channel Side Information	claim
1042	68	Exhaustible sets in higher-type computation	claim
1043	68	Comparing human and automatic thesaurus mapping approaches in the agricultural domain	claim
1044	68	Impact of Vehicular Communications Security on Transportation Safety	claim
1045	68	Locating Restricted Facilities on Binary Maps	claim
1046	67	On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth	claim
1047	67	Analysis of polysilicon micro beams buckling with temperature-dependent properties	claim
1048	67	Noise and thermal stability of vibrating micro-gyrometers preamplifiers	claim
1049	67	Noncoherent Capacity of Underspread Fading Channels	claim
1050	67	State dependent computation using coupled recurrent networks	claim
1051	67	Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog	claim
1052	67	An approach to control collaborative processes in PLM systems	claim
1053	66	Tuneable Capacitor based on dual picks profile of the sacrificial layer	claim
1054	66	A Novel Approach to Formulae Production and Overconfidence Measurement to Reduce Risk in Spreadsheet Modelling	claim
1055	66	Electronic Voting: the Devil is in the Details	claim
1056	66	Low Voltage Totally Free Flexible RF MEMS Switch With Anti-Stiction System	claim
1057	66	Triangulation of Simple 3D Shapes with Well-Centered Tetrahedra	claim
1058	66	On stars and Steiner stars. II	claim
1059	66	The finite harmonic oscillator and its associated sequences	claim
1060	66	The decline in the concentration of citations, 1900-2007	claim
1061	65	Using Intelligent Agents to understand organisational behaviour	claim
1062	65	Succinct Data Structures for Retrieval and Approximate Membership	claim
1063	65	A Lower Bound on the Bayesian MSE Based on the Optimal Bias Function	claim
1064	65	On the Spectrum of Large Random Hermitian Finite-Band Matrices	claim
1065	65	Path lengths in tree-child time consistent hybridization networks	claim
1066	65	Revisiting Norm Estimation in Data Streams	claim
1067	65	An Introduction to Knowledge Management	claim
1068	65	The Wadge Hierarchy of Deterministic Tree Languages	claim
1069	65	Solving functional reliability issue for an optical electrostatic switch	claim
1070	65	A Novel Piezoelectric Microtransformer for Autonmous Sensors Applications	claim
1071	65	Cross-concordances: terminology mapping and its effectiveness for information retrieval	claim
1072	64	Quantum entanglement analysis based on abstract interpretation	claim
1073	64	Differentiation of Kaltofen's division-free determinant algorithm	claim
1074	64	On convergence-sensitive bisimulation and the embedding of CCS in timed CCS	claim
1075	64	Implementing general belief function framework with a practical codification for low complexity	claim
1076	64	An adaptive embedded architecture for real-time Particle Image Velocimetry algorithms	claim
1077	64	Constructing word similarities in Meroitic as an aid to decipherment	claim
1078	64	Beyond Bandlimited Sampling: Nonlinearities, Smoothness and Sparsity	claim
1079	64	Linearly Parameterized Bandits	claim
1080	64	UV Direct-Writing of Metals on Polyimide	claim
1081	64	Study of mechanical response in embossing of ceramic green substrate by micro-indentation	claim
1082	63	Evaluation of the thermal and hydraulic performances of a very thin sintered copper flat heat pipe for 3D microsystem packages	claim
1083	63	Testing Statistical Hypotheses About Ergodic Processes	claim
1084	63	Parimutuel Betting on Permutations	claim
1085	63	Phoneme recognition in TIMIT with BLSTM-CTC	claim
1086	63	On the Asymptotic Behavior of Selfish Transmitters Sharing a Common Channel	claim
1087	63	Linear Time Algorithm for Weak Parity Games	claim
1088	63	Graph Kernels	claim
1089	63	A Public Key Block Cipher Based on Multivariate Quadratic Quasigroups	claim
1090	63	How to Integrate a Polynomial over a Simplex	claim
1091	63	Two Remarkable Computational Competencies of the Simple Genetic Algorithm	claim
1092	63	Desynched channels on IRCnet	claim
1093	63	A toolkit for a generative lexicon	claim
1094	62	Computation of unirational fields	claim
1095	62	On Unique Decodability	claim
1096	62	A complete study of electroactive polymers for energy scavenging: modelling and experiments	claim
1097	61	Bi-criteria Pipeline Mappings for Parallel Image Processing	claim
1098	61	Rich, Sturmian, and trapezoidal words	claim
1099	61	Science mapping with asymmetrical paradigmatic proximity	claim
1100	61	Short proofs of strong normalization	claim
1101	61	Design Methodology and Manufacture of a Microinductor	claim
1102	61	State and history in operating systems	claim
1103	61	GRID-Launcher v.1.0	claim
1104	60	Enhanced Sensing Characteristics in MEMS-based Formaldehyde Gas Sensor	claim
1105	60	The Role of Management Practices in Closing the Productivity Gap	claim
1106	60	Model Based Sensor System for Temperature Measurement in R744 Air Conditioning Systems	claim
1107	60	Goal-oriented Dialog as a Collaborative Subordinated Activity involving Collective Acceptance	claim
1108	60	Self-overlapping Curves Revisited	claim
1109	60	Finding links and initiators: a graph reconstruction problem	claim
1110	60	Stability of Curvature Measures	claim
1111	60	Business processes integration and performance indicators in a PLM	claim
1112	60	Tri de la table de faits et compression des index bitmaps avec alignement sur les mots	claim
1113	59	The Danger Theory and Its Application to Artificial Immune Systems	claim
1114	59	Logical Queries over Views: Decidability and Expressiveness	claim
1115	59	On Gaussian MIMO BC-MAC Duality With Multiple Transmit Covariance Constraints	claim
1116	59	Asymptotic stability region of slotted-Aloha	claim
1117	59	On the Utility of Anonymized Flow Traces for Anomaly Detection	claim
1118	59	A global physician-oriented medical information system	claim
1119	59	Kinematic Analysis of a Serial - Parallel Machine Tool: the VERNE machine	claim
1120	59	Logic programs with propositional connectives and aggregates	claim
1121	59	Assessing scientific research performance and impact with single indices	claim
1122	58	A Most General Edge Elimination Polynomial - Thickening of Edges	claim
1123	58	Some results on (a:b)-choosability	claim
1124	58	Reconstruction of eye movements during blinks	claim
1125	58	HyperSmooth : calcul et visualisation de cartes de potentiel interactives	claim
1126	58	On Ritt's decomposition Theorem in the case of finite fields	claim
1127	58	Codes on hypergraphs	claim
1128	58	Tight Bounds on Minimum Maximum Pointwise Redundancy	claim
1129	58	Fast phylogeny reconstruction through learning of ancestral sequences	claim
1130	58	CSI: A Paradigm for Behavior-oriented Delivery Services in Mobile Human Networks	claim
1131	57	Fast Conversion Algorithms for Orthogonal Polynomials	claim
1132	57	Parameterized Low-distortion Embeddings - Graph metrics into lines and trees	claim
1133	57	Efficient recovering of operation tables of black box groups and rings	claim
1134	57	Feedback Scheduling: An Event-Driven Paradigm	claim
1135	57	Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity	claim
1136	57	Uniqueness of certain polynomials constant on a hyperplane	claim
1137	57	Characterization of the errors of the FMM in particle simulations	claim
1138	57	Information and Data Quality in Spreadsheets	claim
1139	57	ELASTICITY: Topological Characterization of Robustness in Complex Networks	claim
1140	57	Modeling of large area hot embossing	claim
1141	56	The Existence of Strongly-MDS Convolutional Codes	claim
1142	56	On quantum statistics in data analysis	claim
1143	56	Understanding maximal repetitions in strings	claim
1144	56	Vandermonde Frequency Division Multiplexing for Cognitive Radio	claim
1145	56	A Component Based Heuristic Search method with Adaptive Perturbations for Hospital Personnel Scheduling	claim
1146	56	Random drift versus selection in academic vocabulary: an evolutionary analysis of published keywords	claim
1147	56	Complexity of comparison of influence of players in simple games	claim
1148	56	Entropy Concentration and the Empirical Coding Game	claim
1149	55	Persistence of Wandering Intervals in Self-Similar Affine Interval Exchange Transformations	claim
1150	55	A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization	claim
1151	55	Selective association rule generation	claim
1152	55	Faster Approximate Lossy Generalized Flow via Interior Point Algorithms	claim
1153	55	Products of Ordinary Differential Operators by Evaluation and Interpolation	claim
1154	55	A Nanostructual Microwave Probe Used for Atomic Force Microscope	claim
1155	55	The Heap Lambda Machine	claim
1156	55	Automatic Metadata Generation using Associative Networks	claim
1157	55	Dynamics, robustness and fragility of trust	claim
1158	54	Profile Control of a Borosilicate-Glass Groove Formed by Deep Reactive Ion Etching	claim
1159	54	Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms	claim
1160	54	Finding Large Clique Minors is Hard	claim
1161	54	Parameterized Telescoping Proves Algebraic Independence of Sums	claim
1162	54	Amendment to "Performance Analysis of the V-BLAST Algorithm: An Analytical Approach." [1]	claim
1163	53	QoS Challenges and Opportunities in Wireless Sensor/Actuator Networks	claim
1164	53	Existence of a polyhedron which does not have a non-overlapping pseudo-edge unfolding	claim
1165	53	An ESPRIT-based approach for Initial Ranging in OFDMA systems	claim
1166	53	Kinetostatic Performance of a Planar Parallel Mechanism with Variable Actuation	claim
1167	53	Mining Meaning from Wikipedia	claim
1168	53	Zigzag Persistence	claim
1169	52	Out-of-Plane Cmos Compatible Magnetometers	claim
1170	52	0-level Vacuum Packaging RT Process for MEMS Resonators	claim
1171	52	Source Coding with Mismatched Distortion Measures	claim
1172	52	On Computing the Shadows and Slices of Polytopes	claim
1173	52	Network Growth with Feedback	claim
1174	52	Optimizing Quasi-Orthogonal STBC Through Group-Constrained Linear Transformation	claim
1175	52	Weighted distance transforms generalized to modules and their computation on point lattices	claim
1176	52	On the diagonalization of the discrete Fourier transform	claim
1177	52	Bias-Variance Techniques for Monte Carlo Optimization: Cross-validation for the CE Method	claim
1178	52	A static theory of promises	claim
1179	52	Rational Hadamard products via Quantum Diagonal Operators	claim
1180	52	Coding and Decoding for the Dynamic Decode and Forward Relay Protocol	claim
1181	51	GraphStream: A Tool for bridging the gap between Complex Systems and Dynamic Graphs	claim
1182	51	Lambda-Free Logical Frameworks	claim
1183	51	Computing the fixing group of a rational function	claim
1184	50	Graph Sparsification by Effective Resistances	claim
1185	50	Periodicity, repetitions, and orbits of an automatic sequence	claim
1186	50	When are two algorithms the same?	claim
1187	49	Evaluation and exploitation of knowledge robustness in knowledge-based systems	claim
1188	49	The two-user Gaussian interference channel: a deterministic view	claim
1189	48	Human dynamics revealed through Web analytics	claim
1190	48	Monotony in Service Orchestrations	claim
1191	47	Cooperative Spectrum Sensing Using Random Matrix Theory	claim
1192	47	Artificial Immune Systems Tutorial	claim
1193	47	A Quadratic Loss Multi-Class SVM	claim
1194	47	Transport in networks with multiple sources and sinks	claim
1195	47	How could the replica method improve accuracy of performance assessment of channel coding?	claim
1196	47	What It Feels Like To Hear Voices: Fond Memories of Julian Jaynes	claim
1197	46	Micro-electroforming metallic bipolar electrodes for mini-DMFC stacks	claim
1198	46	A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval	claim
1199	46	On row-by-row coding for 2-D constraints	claim
1200	44	Fabrication of Miniaturized Variable-focus Lens Using Liquid Filling Technique	claim
1201	44	An Improved Approximation Algorithm for the Column Subset Selection Problem	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers